Imaging system with multilevel dithering using bit shifter

ABSTRACT

Disclosed is an image processing system which relies upon quantization and dithering techniques to enable an output device, which has a given number of output levels, to accurately reproduce a image which is generated by an input device, which has a greater or equal number of input levels. Generally, neither the number of input nor output levels need to be a power of two. The present invention is implemented in a number of different embodiments. These embodiments generally rely upon an image processor which, depending on the particular implementation, includes memory devices and an adder, a comparator, or a bit shifter. Additional embodiments use an image adjustment system to refine the raw input levels of the input device, in order to create an improved output image. Also, the particular embodiments of the image processors can be used in connection with imaging systems having hi-tonal, monochromatic, or color input and output devices.

FIELD OF THE INVENTION

This invention relates to an apparatus and method for translating aninput image to an output image in an imaging system using quantizationand dithering techniques.

BACKGROUND OF THE INVENTION

As is known in the art, an image processing system is often used totranslate and feed input signals representative of an image in an inputdevice to output signals representative of that same image in an outputimage. For example, a video camera may register a given input image,which is subsequently transferred to an output device, such as a videoscreen, or a printer. Often the input device may have a greater capacityto represent the different colors or gray scale shades of the inputimage than the output device. If the input device can represent morecolors than the output device, an image processing system may beemployed for converting the greater number of input colors to a lessernumber of output colors, to make the output image appear as visuallysimilar to the input image as possible. Four such methods of convertinginput images to output images are 1) histogram based methods, 2)chrominance subsampling, 3) hardware color mixing, and 4) dithering.

With a histogram based technique, a processor is used to collecthistogram statistics on the input image data, and the statisticalinformation is used to compensate the image data. Thus, the histogramtechnique requires two passes of the entire input image data; the firstto acquire the histogram statistics and the second to compensate thedata. This results in a system which has the drawback of being too slowfor those applications in which speed is important. In addition, incases where the colors change gradually over a wide area, considerablecontouring of the image can occur, resulting in a less desirable outputimage.

Chrominance subsampling, on the other hand, typically requiresspecialized hardware, such as unconventional frame buffers and very fastand expensive upscaling and color space conversion hardware. Due to theunique hardware requirements of the chrominance subsampling technique,it is not practical to implement in a general computing environment. Inaddition, the image quality suffers in areas of high chrominance detail.

The third technique, hardware color mixing, requires that the image datamust be preprocessed off line with a multiple pass algorithm. Thus, likethe histogram based technique, this approach is also slow. Additionally,the resulting image file is device dependent, resulting in therequirement of unique hardware, a drawback similar to that of thechrominance subsampling technique.

The fourth technique for converting the greater number of input colorsto a lesser number of output colors, dithering, is based on using theavailable set of output colors in a judicious arrangement so that theillusion of a greater number of output colors is provided. Additionally,the arrangement of the output colors through the dithering technique isdesigned to assure that a pleasing output image is produced.

One such dithering technique is reported in Ulichney, R. "DigitalHalftoning". The MIT Press (1987), hereinafter referred to as"Ulichney". In Ulichney, equation 9.5 provides the following:

    I.sub.k <x,y>=<1/(2.sup.k -1)><int}<(2.sup.k -1) J<x,y>>+D<x,y>}>

where:

I_(k) <x,y> is the output value of the image at position x,y of theoutput image;

K is the number of bits used to represent the output value I<x,y>;

J<x,y> is the input value of the image at position x,y of the inputimage, normalized to a range between 0 and 1;

D<x,y> is the dither matrix value at position x,y of the dither matrix,normalized to a range between 0 and 1;

int{x} is a truncate function in which after any mathematical operationswithin the brackets are performed and a final value is determined, anyamount remaining after the decimal point is truncated so that theremaining value is an integer. For example, int{5.3}=5, andint{27,999}=27;

One drawback to this dithering approach is that the equation onlypermits dithering to powers of 2, rather than any number. Also, theequation requires that the input must be scaled to a range between 0 and1, but does not give any indication of how that scaling is to be done,or how the values of the dither matrix are to be spaced to achievesymmetric dithering.

SUMMARY OF THE INVENTION

This invention relates to an apparatus and method for processing imagesin an imaging system, which translates the input levels of an inputdevice to corresponding output levels of an output device. The imageprocessing apparatus includes a memory device for storing dithertemplate values. The memory device is responsive to an x,y address of agiven input cell of the input device, such that the address causes thememory device to output a stored, dither template value whichcorresponds to the address of the input cell.

The image processor apparatus further includes an adder. The adder addsthe given dither template value, output by the memory device, to theactual input level of the given input cell to produce a sum (S). That Svalue is then bit shifted by a shifter device, and the bit shiftedresult is provided by the image processor to the output device of theimaging system as the output level which corresponds to the input level.

In accordance with the invention, both the number of input levels andthe number of output levels of the imaging system may be any number,provided the number of input levels is equal to or greater than thenumber of output levels, and further provided that the average number ofunique S values that map to a single output level is equal to an integerpower of two.

Alternate embodiments of the invention include an image processingsystem which includes the image processor using the memory device, theadder, and the bit shifter. Yet another embodiment of the inventionincludes the method of processing input and output levels using thememory device, the adder, and the bit shifter.

One advantage of the invention is that any number of input levels andoutput levels can be used, provided that the number of input levels isequal to or greater than the number of output levels, and furtherprovided that the average number of unique S values that map to a singleoutput level is equal to an integer power of two.

Another advantage of the invention is that the implementation of theinvention is accomplished with commonly available computer hardware; nospecialized hardware is required. In one embodiment, the image processoruses only the memory device, the adder, and the shifter.

Yet another advantage of the invention is that the apparatus operatesvery fast, insofar as the production of the corresponding output levelby the image processing apparatus requires the memory look up, theaddition, and the bit shifting to translate the input levels to outputlevels.

Other objects, features, and advantages of the present invention will befurther appreciated and better understood upon consideration of thefollowing detailed description of the preferred embodiments, presentedin conjunction with the accompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram illustration of an imaging system, inaccordance with an embodiment of the present invention, including aninput device, an image processor, and an output device.

FIG. 2A is a graph showing one method of quantizing input levels withrespect to output levels.

FIG. 2B is a graph showing a method of quantizing input levels withrespect to output levels which is in accordance with an embodiment ofthe present invention.

FIGS. 3A-3G illustrate a number of dither templates of varying sizes andlevels.

FIG. 4 includes two, correlated graphs showing a number of input levelsmapped to two output levels.

FIG. 5 includes two, correlated graphs showing a number of input levelsmapped to four output levels.

FIG. 6 is a block diagram of the image processor of FIG. 1, including aLUT generator and a two memory run time system (TMRTS).

FIG. 7 is a block diagram of the LUT generator shown on FIG. 6, coupledto a quantizer LUT and a dither template memory.

FIG. 8 is a flow diagram describing the process by which quantizedvalues and dither template values are produced by the quantizer LUT ofFIGS. 6 and 7.

FIGS. 9A-9C show the modification of the dither template values of aparticular dither template as it is processed through the quantizer LUTof FIGS. 6 and 7.

FIG. 10 is a flow diagram describing the process by which input levelsare used by the image processor of FIG. 6 to produce correspondingoutput levels.

FIG. 11 is a table of exemplary input levels processed by the imageprocessor of FIG. 6, and their corresponding total number of perceivedoutput levels, and an indication whether the given, perceived outputlevel is a true level, or a dithered average.

FIG. 12 is a block diagram of an alternate embodiment of an imageprocessor, in accordance with the present invention, which includes aLUT generator and a comparator run time system (CRTS).

FIG. 13 is a flow diagram describing the process by which dithertemplate values are produced by the quantizer LUT of FIG. 12.

FIG. 14 is a flow diagram describing the process by which input levelsare used by the image processor of FIG. 12 to produce correspondingoutput levels.

FIG. 15 is a block diagram of yet another alternate embodiment of animage processor, in accordance with the present invention, whichincludes a LUT generator, an address/level generator, a single memorytable value determiner (SMTVD), and a single memory run time system(SMRTS).

FIG. 16 is flow diagram describing the process by which quantized valuesand dither template values are produced by the quantizer LUT of FIG. 15.

FIG. 17 is a block diagram of the address/level generator shown in FIG.15.

FIG. 18 is a flow diagram describing the process by which input levelsare used by the image processor of FIG. 15 to produce correspondingoutput levels. D FIG. 19 is a block diagram of still another alternateembodiment of an image processor, in accordance with the presentinvention, including a system data generator and a bit shifter run timesystem (BSRTS).

FIG. 20 is a block diagram of the system data generator shown on FIG. 19coupled to a shifter and a dither template memory.

FIG. 21 is flow diagram describing the process by which an R value, anNIL value, and dither template values are produced by the system datagenerator of FIGS. 19 and 20.

FIGS. 22A-22C show the modification of the dither template values of aparticular dither template as it is processed through the system datagenerator of FIGS. 19 and 20.

FIG. 23 is a flow diagram describing the process by which input levelsare used by the image processor of FIG. 19 to produce correspondingoutput levels.

FIG. 24 is a table of exemplary input levels processed by the imageprocessor of FIG. 19, and their corresponding total number of outputs,perceived output levels, and an indication whether that perceived outputis a true level, or a dithered average.

FIG. 25 is an imaging system, similar to the one in FIG. 1 and inaccordance with the present invention, including within the imageprocessor an image adjustment system.

FIG. 26 is a graphical illustration of the adjustment of raw inputlevels to adjusted input levels by an image adjustment system, showingthe identity transform function.

FIG. 27 is a graphical illustration of the adjustment of raw inputlevels to adjusted input levels by an image adjustment system, showingmultiple transform lines for the purpose of defining the variable"Steepness".

FIG. 28 is a graphical illustration of the adjustment of raw inputlevels to adjusted input levels by an image adjustment system, showing aparticular example of the Steepness variable, as well as defining thevariables "Top", "Low", and "High".

FIG. 29A is a graphical illustration of the adjustment of raw inputlevels to adjusted input levels by an image adjustment system, showingmultiple transform lines for the purpose of defining the variable"Xoffset".

FIG. 29B is a graphical illustration of the adjustment of raw inputlevels to adjusted input levels by an image adjustment system, showing aparticular example of the Xoffset variable.

FIG. 30A is a graphical illustration of the adjustment of raw inputlevels to adjusted input levels by an image adjustment system, showingmultiple transform lines for the purpose of defining the variable"Yoffset".

FIG. 30B is a graphical illustration of the adjustment of raw inputlevels to adjusted input levels by an image adjustment system, showing aparticular example of the Yoffset variable.

FIG. 31 is a graphical illustration of the adjustment of raw inputlevels to adjusted input levels by an image adjustment system, showingtwo transform lines for the purpose of defining the variable"ReverseIn".

FIG. 32 is a graphical illustration of the adjustment of raw inputlevels to adjusted input levels by an image adjustment system, showingtwo transform lines for the purpose of defining the variable"ReverseOut".

FIG. 33 is a table of exemplary values showing a two's-complimentrepresentation, a binary code, an unsigned interpretation, and a shiftedrepresentation.

FIG. 34 is a graphical illustration of the adjustment of raw inputlevels to adjusted input levels by an image adjustment system, showing atransform line for defining the variable "Sign Shift".

FIG. 35 is a graphical illustration of the adjustment of raw inputlevels to adjusted input levels by an image adjustment system, showing atransform line which illustrates the adjustment of a given number of rawinput levels to a lesser number of adjusted input levels.

FIG. 36 is a block diagram of the image processor of FIG. 25, showing avariables determiner, data assignor, data store, sign converter, and anadjust LUT.

FIG. 37 is a flow diagram illustrating the process by which thevariables determiner of FIG. 36 computes the variables "b", "m", "High","Low", and "Top".

FIG. 38 is a flow diagram illustrating the process by which the dataassignor of FIG. 37 generates the adjusted raw input levels and storesthem in the data store of FIG. 37.

FIG. 39 is a flow diagram illustrating the process by which the signconvertor of FIG. 37 generates adjusted input levels and stores them inthe adjust LUT of FIG. 37.

FIGS. 40A-40D are alternate embodiments of the image processors shown inFIGS. 6, 12, 15 and 19, respectively, each such image processorincluding an image adjustment system in accordance with the presentinvention.

FIG. 41 is a block diagram of an imaging system, in accordance with anembodiment of the present invention, including an input device coupledto an output device through multiple image processors.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS A. General

FIG. 1 presents a block diagram illustration of the general environmentin which one embodiment of the image processing apparatus and techniqueof the present invention is applied. Imaging system 20 includes inputdevice 22 which has an input image array 24 with a dimension M_(in)×N_(in). Input array 24 is made up of a number of individual input cells26, represented by the small rectangles of input array 24, and each suchinput cell 26 is addressable by an x_(in) (column) and y_(in) (row)coordinate.

Still referring to FIG. 1, imaging system 20 also includes output device30, which likewise has an output image array 32 having dimensionsM_(out) ×N_(out). Also, output array 32 is made up of a number ofindividual output cells 34, represented by the small rectangles withinoutput array 32, and each such output cell 34 is addressable by anx_(out) (column) and y_(out) (row) coordinate.

In this detailed description, a number of input and output devices willbe discussed. First, an input or output device may be one which iscapable of producing only a bi-tonal image. By definition, a bi-tonalimage is one in which there is only one component for representing theimage, and that component has only two shades. Typically the shades areblack and white, though they need not be.

Second, an input or output device may be a monochrome device, which ischaracterized by having one component used for defining the luminance ofthe image. This type of system may have black and white shades, as wellas intermediate shades of a gray.

Third, an input or output device may classified as color system, aclassification which can be further divided into two sub groups. Thefirst sub group is made up of luminance/chrominance systems, which haveone component which defines the luminance of the image, and twocomponents which together define the characteristics of the hue andsaturation of the image. The second sub group of color systems areso-called "RGB" systems, representing the color primaries, red, green,blue. In such a system there is a first component which defines theamount of red of the image, a second component defining the amount ofgreen, and a third component defining the amount of blue. Together thesethree components define the luminance and chrominance of the image.

It should be noted that in imaging systems generally it is possible tocouple one type of input device with a different type of output device.In other words, a luminance/chrominance type color input device may becoupled to an RGB type output device, for example. Techniques formodifying the data, which is in one format in the input device, forpresentation in a different format in the output device are shown inU.S. Patent Application of Robert Ulichney, entitled "Method andApparatus for Mapping a Digital Color Image From a First Color Space toa Second Color Space", filed on Jun. 26, 1990 and having the Ser. No.07/545,384, now U.S. Pat. No. 5,233,684, which is hereby incorporated byreference.

Referring back to FIG. 1, input cells 26 and output cells 34 are thecells in which the black and white, gray scale shades, and colors of theinput or output images are represented. However, having noted thedifferent types of input and output devices, in order to discuss thesedevices generally, it is convenient to use the term "level" in place ofthe use of the terms "black and white", "gray scale shades", or"colors". Thus, except where the discussion requires distinction, thisdetailed description shall use the term "level(s)" to identify the inputor output images of bi-tonal, monochrome, or color systems.

The input levels of input device 22 are designated "IL", where IL canrange from 0 to <the number of input levels ("NIL") -1>Likewise eachoutput cell 34 is capable of outputting a level which is designated"OL", where OL can range from 0 to <the number of output levels ("NOL")-1>.

In a particular implementation of the multi-level imaging system of thepresent invention, input device 22 could be a video camera, whichdetects an image. That image is registered in input array 24, with theIL of each input cell 26 being represented by "IL<x,y>", where IL<x,y>is the input level at a particular x_(in), y_(in) address in input array24. In such an application, input cells 26 are the individual pixels ofthe input image. In this same implementation, output device 30 could bea video monitor in which output cells 34 of output array 32 representthe output pixels of the video screen on which the input image isviewed. That image is represented in output array 32, with the OL ofeach output cell 34 being represented by "OL<x,y>", where OL<x,y> is theoutput level at a particular x_(out), y_(out) address in the array.Likewise output cells 34 are the individual output pixels of the outputimage.

Still referring to FIG. 1, the dimensions of input array 24, M_(in) XN_(in), and the output array 32, M_(out) ×N_(out), are identical.Accordingly, there is a one to one correspondence between each inputcell 26 and each output cell 34. Although in some imaging systems theinput images may be initially registered into an input array, thedimensions of which are different than the dimensions of the outputarray, there are known cropping and scaling techniques which can be usedto alter the input image so that the dimensions of the input and outputarrays are identical. Accordingly, the application of the embodiment ofthe present invention is in an environment in which the size of M_(in)×N_(in) is the same as the size of M_(out) ×N_(out). Additionally theinput address, x_(in), y_(in) is the same as the output addressx_(out),y_(out), and will hereinafter simply be referred to as x,y.

The multi-level image processing system of the present invention istypically applied in an environment in which the NOL is fewer than theNIL; however, it may also be applied in an environment in which NOL isequal to NIL. In those instances in which NIL is greater than NOL, thepurpose of the system is to map the greater NIL to the lesser NOL.Except with respect to certain embodiments of the invention discussedbelow, neither NIL nor NOL need to be a power of 2. This affords theimaging system with a greater degree of flexibility.

To accomplish the mapping of input levels to output levels, input device22 is coupled to output device 30 through image processor (IP) 40, whichtranslates all IL<x,y> values to corresponding OL<x,y> values. Thistranslation involves quantization and dither templates, both of whichwill be further discussed below. Before focusing upon a specificembodiment of the invention, it is helpful to first consider how animage processor, such as IP 40, can generally map input levels to outputlevels.

Referring to FIG. 2A, a graph having any number of input levels, IL, and4 output levels is provided. In this example, the smallest output level,OL=0, is mapped directly to the smallest input level, which on the graphis designated 0Δ_(Q). Additionally, the largest output level, OL=3, ismapped directly to the largest input level, which on the graph isdesignated 3Δ_(Q). By virtue of the direct mapping of smallest tosmallest and largest to largest, there are no input levels less than0Δ_(Q) that also map to OL=0, and no input levels greater than 3Δ_(Q)that map to also map to OL=3. Having made this assignment at the twoextremes of the graph, the interior portion of the axis on which theinput levels are graphed is then evenly divided by 1Δ_(Q) and 2Δ_(Q),with 1Δ_(Q) being assigned a direct mapping to OL=1 and 2Δ_(Q) beingassigned a direct mapping to OL=2.

Moreover, in the quantization approach shown in FIG. 2A, whendetermining the input levels which are mapped to a given output level,there is no adjustment of the NIL and NOL by any factor in order toprovide an even distribution so that all input levels are mapped totheir closest output level. Rather, quantization is achieved by simplydividing NIL by NOL. Accordingly, each range of input levels mapped to agiven output level is equal, and in this instance those ranges are equalto NIL/4 as shown on the graph.

Although it may appear that this quantizer approach is symmetric,because all ranges of input levels are equal, the approach will actuallyresult in quantization error, because certain input levels will notnecessarily be mapped to their closest assigned output level. Forexample, referring to IL.sub.(a) it would be mapped to OL=0, even thoughit is apparent from the graph that it is actually closer to 1Δ_(Q),which is the input level assigned to OL=1. Likewise, referring toIL.sub.(b) it would be mapped to OL=3, even though it closer to 2Δ_(Q),which is the input level assigned to OL=2.

Thus this straight quantization approach, in which the number of inputlevels which are mapped to a given output level is determined by adirect division of NIL by NOL, provides an uneven distribution of inputlevels around the assigned output levels resulting in quantizationerror. An imaging system based on this quantization error will produce aless desirable output image than one which evenly distributes the inputlevels around the assigned output levels. The image processing system ofthe present invention does evenly distribute the input levels around theassigned output levels to reduce the quantization error.

Referring to FIG. 2B for a general description of the method by whichthis is done, a graph is provided in the same basic format as shown inFIG. 2A. In FIG. 2B, the smallest output level, OL=0, is mapped directlyto the smallest input level, which on the graph is designated 0Δ_(Q),and the largest output level, OL=3, is mapped directly to the largestinput levels the axis is evenly divided by 1Δ_(Q) and 2Δ_(Q), with1Δ_(Q) assigned to OL=1 and 2Δ_(Q) assigned to OL=2.

Unlike the approach taken in connection with FIG. 2A, the imageprocessing technique of the present invention adjusts the NIL and NOL bya factor that eliminates the quantization error and provides an evendistribution of input levels with respect to output levels. In thisapproach, NIL and NOL are both reduced by one before the division whichdetermines the number of input levels which are mapped to a given outputlevel. Accordingly, quantization is accomplished by first calculatingΔ_(Q), where:

    Δ.sub.Q =(NIL-1)(NOL-1)                              (Equation I).

Through this equation, Δ_(Q) =(NIL-1) / (4-1)=(NIL-1)/3, in the givenexample.

Next, the image processing technique refines the distribution of theinput levels which appear at either end of the x axis, so that there issymmetry of all input levels around their related Δ_(Q) assignment,0Δ_(Q) through 3Δ_(Q). This is accomplished by dividing Δ_(Q) in half,and using that quotient to determine the span of the first and lastrange of input levels which are mapped to the smallest and largestoutput levels, respectively. In between the two end ranges, Δ_(Q)determines the span of the range of input levels which are mapped tooutput levels falling between the smallest and largest output levels.

Supposing, for example that the NOL in FIG. 2B was 256. Using EquationI, Δ_(Q) is equal to (256-1)/(4-1), or 85. Thus, in FIG. 2B, theresulting mapping of input levels to output levels would be:

                  TABLE A                                                         ______________________________________                                               IL              OL                                                     ______________________________________                                                0   through 42                                                                              maps to  0                                                      43  through 127                                                                             maps to  1                                                     128  through 212                                                                             maps to  2                                                     213  through 255                                                                             maps to  3                                              ______________________________________                                    

As seen from Table A with NIL=256, IL can range from 0 through 255; andwith NOL=4, OL can range from 0 through 3. Also in Table A it can beseen that Δ_(Q) /2, or 85/2=42.5, determines the span of input levels,rounding to 43, that are mapped to the smallest output level, namely 0through 42 map to OL=0. In between this first range and the last range,which is 213 through 255, are spans of input levels which are equal toΔ_(Q), such as 43 through 127 being mapped to OL=1 and 128 through 212being mapped to OL=2. In this respect, the value of Δ_(Q) will determinethe range of input levels which are covered by any given output level,except that at the ends of the full range of input levels, the number oflevels covered is equal to Δ _(Q) /2, as shown in graph segments 42 and44 of FIG. 2B.

This adjustment of NIL and NOL before quantization provides a symmetricdistribution of input levels around their respective output levels. Asshown in FIG. 2B, IL.sub.(a), which is in the same

position on the graph as it is on FIG. 2A, is mapped to OL=1 because itis closer to 1Δ_(Q), which is assigned to OL=1. Likewise, IL.sub.(b), ismapped to OL=2 given that it is closer to 2Δ_(Q), which is assigned toOL=2. Accordingly, the quantization technique assures both that there isa direct mapping of the smallest output level to the smallest inputlevel, and the largest output level to the largest input level, and thatthere is a symmetric distribution of the input levels around the closestassigned output level.

Thus far the multi-level, image processing technique of the presentinvention has relied upon a quantization method for mapping a greaternumber of input levels to the lesser number of output levels. Thetechnique of the present invention further combines quantization withthe use of a dither template so that even though output device 30 canonly output a given number of "true" levels, output device 30 providesthe illusion that it is capable of outputting "intermediate" levels, aswell as the true levels. The meaning of "true" and "intermediate" levelswill be further discussed below.

Referring now to FIGS. 3A through 3F, a number of dither templates areillustrated. A dither template is a grouping of elements arranged in aparticular order, with each such element being taken from the set ofwhole numbers that range from 0 to <the number of template levels("NTL")-1>. Each such template can be defined by reference to: its size,which is given as an M_(tmp) ×N_(tmp) array; its NTL; and the order ofelements in the array. For example, referring to FIG. 3C, the size ofthe array is M_(tmp) =N_(tmp) =4, which is a 4×4 array. The NTL is 8,meaning that the value of the elements in the array range from 0 through<8-1>, or 0 through 7. And the order of the elements is as shown in FIG.3A. "T<x',y'>" will hereinafter be used as the term which defines agiven dither template by reference to the order of its elements,understanding that once the order of the elements is known the M_(tmp)×N_(tmp) size and the NTL can be easily determined by reference to therow-column arrangement and the actual value of the elements.

Although a given dither template has a certain M_(tmp) ×N_(tmp) sizearray, in many instances it is possible to map that array into a largermemory array, M_(mm) ×N_(mm), by "tiling", or repeating, the smallertemplate pattern across the larger memory array. For example, FIG. 3Bincludes a dither template having a size M_(tmp) =N_(tmp) =2, NIL=4,with the elements ordered as shown. Even though this template isarranged as a 2×2 it can be mapped into a larger memory array, such asan 8×8 array. Referring now to FIG. 3G, it can be seen how the smaller,2×2 dither template of FIG. 3B is tiled into the larger 8×8 memory arrayso that the larger array preserves the basic dither template pattern.

It should be noted that one limitation to the ability to tile a smallerdither template into a larger dither template memory is that the size ofthe dither template must divide evenly into the size of the dithertemplate memory. Stated differently, M_(mm) must be evenly divisible byM_(tmp) and N_(mm) must be evenly divisible by N_(tmp). For example, the2×2 template evenly divides into the 8×8 memory array; however, a 3×3template would not. The significance of tiling the dither pattern into alarger memory array will be discussed below.

Finally with respect to dither templates, it should also be noted thatthe term "T<x',y'>" will be used to define not only the order of anoriginal, small, dither template, but also the order of a dithertemplate which is the result of tiling the small dither template into alarger memory array.

Having discussed quantization and dither templates, it can now be shownhow these two techniques are combined in image processor 40 to providethe visual impression that output device 30, shown in FIG. 1, is able tooutput a greater number of output levels than it actually can. In otherwords, through the image processing technique, output device 30 canproduce the illusion that it can output more levels than simply the"true" levels that it is actually capable of outputting. In this manner,output device 30 can render an output image which is closer in fidelityto the original input image. Furthermore, output devices employing theimage processing technique will produce a more visually pleasing outputimage.

Referring now to FIG. 4, quantization and dither templates are combinedto produce perceived output levels using dither template 50 where M=N=2and NTL=4 is used. In FIG. 4 are two graphs, Graph 53 and Graph 54, eachhaving the x axis segment including a number of input levels rangingfrom IL_(a) through IL_(b). The y axis segment includes two outputlevels, OL_(a) and OL_(b). For the purpose of this example, it isassumed that OL_(a) is dark gray, and OL_(b) is light gray, in whichcase OL_(a) and OL_(b) are defined as the two, true, output levels whichoutput device 30 is capable of providing. However, it will be clear tothose skilled in the art that OL_(a) and OL_(b) can be any levels, andthat dark gray and light gray are used here only to provide a simpleexample of how the multi-level image processing technique works.

Included also in FIG. 4 are representations of five different ditherpatterns, 52a through 52e, that can be achieved using the two inputlevels and dither template 50. Even though output device 30 can onlyoutput two levels, through shading the individual cells with dark grayor light gray in a pattern which is determined by the dither template,intermediate levels are effectively produced. In other words, eventhough output device 30 can only truly output dark gray and light gray,the technique of the present invention achieves the illusion ofintermediate colors by causing the eye to perceptually average the twotrue colors because they are judiciously distributed across the dithertemplate.

It should be noted that although in the examples discussed in connectionwith FIGS. 4 and 5 it will be stated that the dither template itself isshaded, in actual implementations of the present invention in an imagingsystem it is the output array, such as a video monitor screen, and notthe dither template, that is shaded. On the other hand, in connectionwith the more detailed discussion of IP 40 below, it will be explainedthat the specific values that appear in the cells of the dither templateare indirectly mapped to specific cells in an output array, such asoutput array 32 of FIG. 1. And, those cell values are instrumental indetermining the shading of the output array. Given this association, forthe purpose of a simplified explanation in connection with FIGS. 4 and5, the cells of the template will be treated as if they can be shaded,while the more specific explanation of the role of the template will bepresented below.

Still referring to Graph 53, the input levels falling between IL_(a) andIL_(b) are themselves divided into ranges, Δ_(d), which are determinedon the basis of the NIL, the NOL, and the NTL of a particularimplementation. Each of these variables are instrumental in determiningthe division of input ranges which are necessary for the faithfulreproduction of the output image. In one embodiment, the division ofranges, Δ_(d), is:

    Δ.sub.d =Δ.sub.Q /(NTL)                        (Equation II).

Accordingly, in Graph 53 Δ_(d) is shown to span groups of intermediateinput values which fall between IL_(a) and IL_(b). At either end of theinput levels, however, there is an Offset which is applied in order toassure that there is a symmetric distribution of input levels aroundoutput levels. In the embodiment shown on FIG. 4,

    Offset=Δ.sub.d /2                                    (Equation III).

This offset is similar to the offset discussed above in connection withthe apportioning of input levels around a given Δ_(Q) at either end ofthe full range of input levels.

Still referring to FIG. 4, the first dither pattern 52a is one in whichall of the cells of the dither template are shaded dark gray,Accordingly, section 56a of Graph 53 shows 4 cells shaded dark gray, and0 of the cells shaded light gray. The second dither pattern 52b is onein which 3 of the cells are dark gray, while 1 of the cells is lightgray; therefore, section 56b of Graph 53 shows 3 dark gray cells and 1light gray cell. The third dither pattern 52c shows 2 cells shaded darkgray and 2 shaded light gray, with a corresponding representation insection 56c of Graph 53. The other two dither template patterns, andtheir corresponding graphic representations are likewise shown in FIG.4.

Also included on FIG. 4 is Graph 54, which is associated with Graph 53,as indicated by the dashed lines connecting the graphs. Like Graph 53,Graph 54 includes the same input levels, IL_(a) through IL_(b), on the xaxis. The full range of input levels are covered by Δ_(Q), and theintermediate levels are subdivided into smaller Δ_(d) ranges, as shown.In addition, the y axis of 20 Graph 54 includes the two true outputlevels of output device 30, OL_(a) (dark gray) and OL_(b) (light gray).

From FIG. 4 it is graphically shown how intermediate levels are producedby the combination of quantization and the dither template. Namely, inbetween the true output levels, OL_(a) (dark gray) and OL_(b) (lightgray), there are three intermediate levels. These levels are what wouldbe seen by one looking at the dither template if it is shaded in thevarious patterns, 52a through 52e, discussed in connection with FIG. 4.

Dark gray and light gray are the result of the shading of all of thetemplate cells with the two true colors, respectively. On the otherhand, when 3 template cells are shaded dark gray and 1 is light gray,the intermediate level perceived by one looking at the template will bea shade of gray falling between dark gray and light gray, but visuallycloser to dark gray. On the other hand, when 3 cells are shaded lightgray and 1 is shaded dark gray, the intermediate level will also be ashade of gray falling between dark gray and light gray, but will bevisually closer to light gray.

As shown in Graph 54, the intermediate levels between dark gray andlight gray are represented by the gradual stair step progression of thegraph from dark gray to light gray. Furthermore, Graph 54 shows how thefull range of input levels, IL_(a) through IL_(b), map into either thetrue output levels, OL_(a) and OL_(b), or the perceived intermediatelevels.

Generally, the number of perceived output levels ("NPOL") that aparticular output device 30 is capable of outputting, is determined bythe NOL that the system is able to output, and the NTL of the dithertemplate. The relationship is:

    NPOL=<(NTL)(NOL-1)+1>, when Δ.sub.d >1; and

    NPOL=NIL, when Δ.sub.d ≦1 .                   (Equation IV).

Therefore, for the example shown in FIG. 4 in which Δ_(d) >1, theNPOL=<4(2-1)+1>=5, which is confirmed by the total number of perceivedoutput levels shown on the x-axis segment of Graph 54.

Referring now to FIG. 5, a more complete example of the multi-levelimage processing system of the present invention is shown, combiningquantization, a dither template, and the use of a greater NOL than wasillustrated in FIG. 4. Similar to FIG. 4, FIG. 5 includes Graphs 55 and57 on which the x axis of each includes a number of input levels,ranging from 0 to (NIL -1), which are the input levels which inputdevice 22 is capable of registering. The y axis of each includes fourtrue output levels, 0, 1, 2, and 3. As discussed above, the presentinvention can be applied with any number of input or output levels. Thenumbers chosen for purposes of this illustration, however, arerelatively small so that the explanation of the principles of theembodiment of the invention can be less complex. Those principals,however, would be applied the same if a greater number of input andoutput levels are used.

Like FIG. 4, FIG. 5 has dither template 60 where M_(tmp) =N_(tmp) =2 andNTL=4. Each input level is included within the span of a given Δ_(Q),which is determined in accordance with Equation I, above. Likewise, eachof the input levels is included within the span of a given Δ_(d), whichis determined in accordance with Equation II, above. At either end ofthe full range of input levels, it can be seen that the width of thefirst section 62 and the last section 64 of Graph 55 is only Δ_(d) /2.This offset is consistent with the Offset which is determined inaccordance with Equation III. Although at the two ends of the range ofinput levels, IL_(a) and IL_(b), the span of the two end sections areonly Δ_(d) /2 wide, from Graph 55 it can be seen that in the middleportions of the graph, adjoining half sections of Δ_(d), together formfull sections which are Δ_(d) wide. Consequently, the combined halfsections succeed in providing a symmetrical distribution of input levelsaround their perceived, output levels.

As shown in Graph 55, the four true levels which output device 30 iscapable of outputting are: 013 black; 1--dark gray; 2--light gray; and3--white. As with the two levels discussed in connection with FIG. 4,these levels have been arbitrarily chosen to illustrate a particularembodiment of the present invention, and any other levels could havebeen chosen.

Referring first to graph segment 62 on Graph 55, if the 4 cells of thedither template 60 are all shaded black, then the true level black wouldbe visible to one looking at dither template 60. Furthermore, with the 4cells shaded black, output array 32 would be outputting a true level,namely black. In graph segment 64, if 3 of the 4 cells are shaded black,and 1 of them is shaded dark gray, than a visually intermediate levelwill be perceived by looking at the shaded dither template 60. Thatintermediate level will be visually close to black, but will be slightlylighter than solid black, because one of the cells will be shaded darkgray. Thus the eye of the person looking at the template averages theappearance of the individual cells to perceive the intermediate level.Progressively the illusion of lighter, intermediate levels can beprovided on dither template 60 as more cells are turned onto dark grayand fewer onto black, as shown in segment 70. As shown on segment 72, ifall of the pixels in the template 60 are turned to dark gray, thendither template 60 would project the true level, dark gray.

Considering one other example at the far right of Graph 55, in segment74 three cells have been shaded light gray and one has been shadedwhite, thereby providing the visual illusion in dither template 60 of alevel that is between light gray and white. At the very end of the rangeof input levels, input levels within Δ_(d) /2 of (NIL-1), are mapped tothe level white. As shown on Graph 55, in segment 64, the four cells ofdither template 60 have been shaded white, which is another one of thefour, true, input levels.

FIG. 5 further includes Graph 57, which is associated with Graph 55 asshown by the dashed lines through the graphs. On the x axis, Graph 57includes the same input levels ranging from 0 to (NIL-1), which aredivided into Δ_(Q) and Δ_(d) segments. Similar to Graph 54, the stairstep progression of Graph 57 graphically shows that although outputdevice 30, shown on FIG. 1, is capable of outputting only four truelevels, - - - 0--black; 1--dark gray; 2--light gray; and 3--whitethrough the multi-level image processing technique of the presentinvention, output device 30 is capable of outputting a total of 13perceived levels, four of which are true levels, and 9 of which are theintermediate levels which fall between the true levels. As stated above,Equation IV determines the total number of perceived levels which outputdevice 30 is capable of outputting, which, when applied to the exemplaryoutput device of FIG. 5 confirms that the total number of levels is 13.

To the extent that the NPOL is influenced by the NTL, as well as theNOL, there may be a motivation to choose a dither template with a veryhigh NTL to increase the NPOL. The higher the NTL the greater the sizeof the M×N array of the template, which requires a larger size memory.Therefore, there is a cost associated with having a higher NTL, whichmust be balanced against the benefits of having more perceived levels.

B. Multilevel Dithering System with Two Memories

Having explained how quantization and dither templates are generallyused in IP 40, shown on FIG. 1, to provide the illusion of output device30 being capable of outputting more levels than the number of truelevels which it can actually output, a specific embodiment of IP 40 willnow be discussed.

Referring momentarily back to FIG. 1, the overall objective of imagingsystem 20 is to take the IL<x,y> value of a given input cell 26 in inputdevice 22, and translate it to an OL<x,y> value in the correspondingoutput cell 34 in output device 30. As shown in FIG. 1, coupled betweeninput device 22 and output device 30 is IP 40, which accomplishes thistranslation.

Referring now to FIG. 6, a block diagram of IP 40 is shown to includetwo major block components, Look Up Table ("LUT") generator 80, and atwo memory run time system 81 ("TMRTS"), which is shown in dashed lines.TMRTS 81 includes a dither template memory 82, which is initialized withvalues d<x',y'> by LUT generator 80. TMRTS 81 further includes anaddress modifier circuit 87, which is used to convert addresses x,y ofan input cell 26 of input device 22, shown on FIG. 1, to addresses x',y'which are applied as an address to access the values stored in dithertemplate memory 82. The output of dither template memory 82, d<x',y'>,are fed to an adder 85. Adder 85 is also fed an input level, IL<x,y>,for the given input cell 26, and the two values are added by adder 85 toproduce a sum value, S. S is used as an address to quantizer LUT 86 toproduce output values OL<x,y>, which are fed to the output device 30 ofFIG. 1. As with dither template memory 82, quantizer LUT 86 isinitialized with values Q<S> from LUT generator 80.

In this particular embodiment of the invention, LUT generator 80determines values which are stored in the dither template memory 82 andquantizer LUT 86. LUT generator 80 does not necessarily need to run atany particular speed since it computes these values before imagingsystem 20 starts translating input pixels to output pixels during realtime operation. Instead, after LUT generator 80 determines and storesthe values in the memory and look up tables, it will resume activityonly if some of the imaging system 20 parameters change.

On the other hand, in this particular implementation, TMRTS 81 is theportion of IP 40 which does operate in real time, and during operationit is constantly receiving input values, IL<x,y>, from input array 24,shown in FIG. 1, and processing them into corresponding output values,OL<x,y> in output array 34.

IP 40, and in particular, LUT generator 80 is fed by signalscorresponding to: the number of input levels, NIL; the number of outputlevels, NOL; the number of dither template levels, NTL; the dithertemplate order T<x',y'> phase₋₋ x and phase₋₋ y values; and thedimensions of the dither template memory M_(mm) ×N_(mm). Addressmodifier 87 of IP 40 is fed the x and y address values for a given inputcell, x,y, and adder 85 is fed the actual input level of the given inputcell at the x, y address, IL<x,y>. With this information IP 40 willcompute the appropriate OL<x,y> for the corresponding IL<x,y>.

It should be noted that one of the sets of variables input into IP 40,namely phase₋₋ x, phase₋₋ y, has not yet been discussed. Briefly,phase₋₋ x and phase₋₋ y are the variables which define the twodimensional spatial shift of the dither matrix relative to a particulardither matrix arrangement immediately prior to the shift. The method bywhich these variables determine the shift and the importance of theshift will be further detailed below.

Referring now to FIG. 7, LUT generator 80 is shown to include avariables determiner circuit 90 which is fed by signals corresponding toNOL, NIL, and NTL to provide data signals representing: Δ_(Q), thenumber quantization levels, and {_(d), the subdivisions of thequantization levels. The variables determiner circuit 90 uses anyconventional arithmetic circuit to provided these values by solvingEquations I and II, above.

The signals corresponding to NOL and Δ_(Q) are fed to quantizergenerator 92. Quantizer generator 92 uses these signals to produce atable of values Q<S> which is stored in quantizer LUT 86, shown in FIG.6.

The LUT generator 80 is shown to further use a memory device, whichcould be the same memory device used for dither template memory 82, forthe temporary storage of a suitable dither template. One embodiment ofthe invention, incorporates the dither template shown in a copendingpatent application Ser. No. 07/961,244, filed Oct. 15, 1992, entitled"Void and Cluster Method for Generating Dither Arrays", the inventor ofwhich is Robert Ulichney the contents of which is hereby incorporated byreference. The referenced application was filed on the same date as thisapplication and it has also been assigned to the same assignee, DigitalEquipment Corporation, as this application.

Dither template values, T<x',y'>, are shown on FIG. 7 as referencenumeral 94. They are fed to dither normalizer 96 which adjusts thedither template values so that they are made to be symmetricallydistributed in a manner which is detailed below.

The output from the dither normalizer 96 as stored is shown by referencenumeral 97, and these values are fed into phase adjuster circuit 100along with phase₋₋ x, phase₋₋ y, and M_(mm) ×N_(mm) signals. Phaseadjuster 100 processes the values by spatially shifting the elementswithin the dither matrix. Thus, the elements of the dither matrix whichhave a particular location within the matrix prior to phase adjustment,are adjusted to a different location within the dither matrix on thebasis of the phase₋₋ x and the phase₋₋ y values The resulting valuesd<x',y'> are then stored in dither matrix memory 82, shown on FIG. 6.

In order to illustrate how LUT generator 80 operates, a simple examplewill be developed through which actual values will be assigned to thevarious input signals to see how those values are processed through IP40. As discussed above, relatively small numbers are used for thepurpose of illustrating the principles underlying the embodiment of thisinvention; however, larger input values would work in the same mannerillustrated. In addition to FIG. 7, FIG. 8 includes a flow diagramshowing the steps of the process, and the flow diagram of FIG. 8 will bereferred to in conjunction with the discussion of FIG. 7.

In this example, it will be assumed that the following input signals areprovided to LUT generator 80 by imaging system 20.

                  TABLE B                                                         ______________________________________                                                 NIL = 256                                                                     NOL = 4                                                                       NTL = 4                                                                       Element ordering is:                                                                      1 2                                                                           3 0                                                               M.sub.mm = 8                                                                  N.sub.mm = 8                                                                  Phase.sub.-- x = -1                                                           Phase.sub.-- y = -1                                                  ______________________________________                                    

It should be noted that although a preferred dither template wasreferred to above, a relatively simple dither template has been used inthis particular example for purposes of providing a less complicateddiscussion of the principles underlying the embodiment of the invention.However, the use of the more complex dither template would be inaccordance with the same principles.

Referring back to FIG. 7, variables determiner 90 receives NIL, NOL, andNTL and uses that information to compute the values for Δ_(Q) and Δ_(d).The computation of Δ_(Q) is accomplished in accordance with Equation I,such that in this particular example, Δ_(Q) =(256-1)/(4-1)=85 (Step 110,FIG. 8). Similarly, the computation of Δ_(d) is accomplished inaccordance with Equation II, such that Δ_(d) =85/4=21.25 (Step 112, FIG.8).

As shown in FIG. 7, the Δ_(Q) value is output by variables determiner 90to quantizer generator 92, which determines the values which are thenstored in quantizer LUT 86. Quantizer generator 92 uses Δ_(Q) todetermine the different values of Q<S>, where particular Q<S> values areoutput by quantizer LUT 86 in response to any "S" value input intoquantizer LUT 86 by adder 85, as shown in FIG. 6 (Step 116, FIG. 8). Thegeneration of S by adder 85 will be further discussed below. Theequation employed by quantizer generator 92 to produce Q<S> is:

For each OL={0 through (NOL-1)}, Q<S>=OL, for those values of S thatsatisfy:

int {(OL)(Δ_(Q))+0.5}≦S<int {(OL+1)(Δ_(Q))+0.5}(Equation V).

Using the values given in Table B and Equation V, quantizer generator 92would compute and store the following values in quantizer LUT 86.

                  TABLE C                                                         ______________________________________                                        For S from:  0 through 84, OL<x,y> = 0;                                                    85 through 169,                                                                             OL<x,y> = 1;                                                   170 through 254,                                                                             OL<x,y> = 2;                                                   255 through 339,                                                                             OL<x,y> = 3.                                       ______________________________________                                    

In this particular implementation, quantizer LUT 86 has addresslocations from 0 through 339. The storage of the OL values at thoseparticular address locations is in accordance with Table C, such that ataddress locations 0 through 84, the output value 0 is stored. Thus, thenumber of unique S values that map to the given output level 0 is 85. Ataddress locations 85 through 169, the value 1 is stored, so that thenumber of unique S values that map to the given output level 1 is also85. The same is true of the other two sets of values, in which thenumber of unique S values that map to the output levels 2 and 3 arelikewise 85.

Although the method by which adder 85 produces the S values has not yetbeen detailed, it will be shown through the discussion below that, in agiven implementation, adder 85 will produce a finite number of unique Svalues. This is because in a given implementation the number of possiblevalues which are summed together by adder 85 are finite. Understandingthis fact in combination with the Equation V, the definition of Δ_(Q)can now be refined.

More particularly, Δ_(Q) is the average value of the number of unique Svalues which can be produced by adder 85 in a given implementation andwhich map to a single, given output level. In order to determine whatthat average value is in any particular implementation, it is necessaryto determine the finite numbers of possible addends to be added by adder85, and compute all of the possible S values. After the total number ofpossible, unique S values are determined, then they must be mapped totheir respective output levels. In any given implementation there isalso a finite number of output levels, and each possible, unique S valuewill map to one of those output levels. Therefore, the definition ofΔ_(Q) is refined to represent the average value of the number of uniqueS values that map to a single, given, output level, if all possible Svalues were produced by adder 85 and mapped to their correspondingoutput level in quantizer LUT 86.

Additionally, Δ_(Q) is a real number, and Equation V shows that thenumber of unique S values that map to any single, given, output leveldoes not differ by more than 1. In the particular example provided inconnection with Table C, Δ_(Q), as the average value of the number ofunique S values that map to a single, given output level, is equal to85. Although in this particular example all such numbers were equal to85, such that the average is 85, in other implementations, the number ofunique S values that map to different, given output levels may notalways be the same. As indicated by Equation V, however, they willdiffer by no more than one.

During the operation of IP 40, as an S value is sent to quantizer LUT 86by adder 85, shown in FIG. 6, the S value provides an address to thememory device of quantizer LUT 86, and the corresponding output value atthat address is then provided as OL<x,y>. For example, if S is equal to273, quantizer LUT 86 would output an OL equal to 3. On the other hand,if S is equal to 93, quantizer LUT 86 would output an OL equal to 1.Having OL<x,y> output as soon as the appropriate address is accessed inquantizer LUT 86 contributes substantially to the speed of the overallimaging system.

Continuing with the discussion of the block components, FIG. 7 shows theorder of the dither template, T<x',y'>, as another input into LUTgenerator 80. As explained in connection with the discussion of FIG. 3G,above, in those instances in which the dimension of the dither templateis smaller than the dimension of the memory, it is possible to tile thedither template into the memory so that the entire memory space isfilled with the dither pattern (Step 120, FIG. 8).

In this particular instance, the dither template, shown in Table B, hasa 2×2 dimension, while the dither template memory is 8×8 . Therefore,imaging system 20 would have tiled the smaller dither template into thelarger dither template memory so that in the embodiment shown, theT<x',y'> presented as an input to LUT generator 80 is the fully expandeddither pattern. On the other hand, if instead of using the 2×2 dithertemplate shown in Table B, an 8×8 dither template was used, no suchtiling would be necessary, as the dither template would fit within thedither template memory without repetition.

As shown on FIG. 7, the numerical values of the elements in the dithertemplate, T<x',y'> are next processed by dither normalizer 96 (Step 122,FIG. 8). Through dither normalizer the dither matrix values are adjustedto be symmetrically distributed between 0 and the average value of thenumber of unique S values which can be produced by adder 85 and whichmap to a single, given output level. As discussed above, that average isequal to Δ_(Q), which is determined in accordance with the methoddiscussed above.

As shown on FIG. 7, dither normalizer 96 uses the values Δ_(d), which isoutput by variables determiner 90. Dither normalizer 96 combines thevalues for T<x',y'> and Δ_(d), and Offset in the following equation forthe purpose of outputting normalized values, D<x',y'>, where:

    D<x',y'=int{Δ.sub.d (T<x',y'>+1/2)}                  (Equation VI )

It should be noted that Equation VI is derived from the equation:D<x',y'>=int{<(T<x',y'>)(Δ_(d))>+Offset}. This equation, however, can besimplified into Equation VI using the expression for Offset provided inEquation III. Accordingly, dither normalizer uses the simplifiedEquation VI, and does not need to have Offset separately computed.

Using the specific values of this example, when the given T<x',y'>values shown in FIG. 9A are processed by dither normalizer 96 usingEquation VI, the resulting D<x',y'> values are shown in FIG. 9B. As seenby comparing the values in FIG. 9A and 9B, each of the original dithertemplate values has been adjusted so that they are symmetricallydistributed within the range that extends from 0 through the value ofΔ_(Q), which in this example is 85. Thus the value 0 is adjusted to 10;the value 1 is adjusted to 31; the value 2 is adjusted to 53; and thevalue 3 is adjusted to 74.

Next, the D<x',y'> values are processed by phase adjuster 98, which usesthe values for phase₋₋ x, phase₋₋ y, N_(mm), and N_(mm), to provide atwo dimensional, spatial shift of the elements within the dither matrix(Step 124, FIG. 8). Thus, each of the elements of the dither matrixwhich have a particular location within the matrix prior to phaseadjustment, are adjusted to a different location within the dithermatrix on the basis of the phase₋₋ x and the phase₋₋ y values.

In the embodiment shown on FIG. 7, the D<x',y'> values, phase₋₋ x,phase₋₋ y, M_(mm), and N_(mm) are combined in the following equation forthe purpose of outputting d<x',y'>, which is the final value that isstored in dither template memory 82, shown on FIG. 6. The equation is:

    d<x',y'>=D<(x'+phase.sub.-- x)modulo(M.sub.mm), (y'+phase.sub.-- y)modulo(N.sub.mm)>,

where:

    A modulo(B)=the remainder resulting from A/B               (Equation VII)

After the values for D<x',y'>, as shown in FIG. 9C, are processed byphase adjuster 98 along with the values for phase₋₋ x, phase₋₋ y,M_(mm), and N_(mm), the final values, d<x',y'>, are stored in dithertemplate memory 82 (Step 126, FIG. 8). FIG. 7 shows phase adjuster 98inputting d<x', y'> into dither template memory 82, and FIG. 9C showswhat those stored values would be for the given example.

As seen by comparing FIG. 9B and 9C, through the phase adjustmentprocess the elements in FIG. 9B, which is the arrangement of the dithermatrix elements immediately prior to the phase adjustment step, havebeen shifted down and to the right by one. This is because phase₋₋x=(-1) and phase₋₋ y=(-1). If phase₋₋ x=(2) and phase₋₋ y=(3), foranother example, then the dither template values would have been shiftedup 2 and to the right 3.

Given that the dither matrix is designed to "wrap around", during thephase adjustment process, the elements along the right side and bottomare simply adjusted to the left side and the top, respectively. Thephase adjustment process is particularly useful in connection with theimplementation of dithering systems which involve color primaries, suchas red, green, and blue, as will be discussed below.

Having reviewed the internal operation of LUT generator 80, and havingshown how the specific values are generated and stored in dithertemplate memory 82 and quantizer LUT 86, reference can now be made backto FIG. 6 for a further explanation of the operation of IP 40. Thisexplanation will be provided in conjunction with the flow diagram ofFIG. 10. As stated above, after table value determiner 41 fills dithertemplate memory 82 with the d<x',y'> values and quantizer LUT 86 withQ<s> values (Step 130, FIG. 9), TMRTS 81 is prepared to determine theoutput levels of pixels in output device 30 which correspond to inputlevels of pixels in input device 22 during real time operation.

As shown on FIG. 6, during real time operation address modifier 87receives the x,y address of a specific input cell 26 from input device22. In response to that x,y address, address modifier 87 will adjust thex,y address because the dimension of the input array 24 is likely to bemuch larger than the dimension of the dither template memory (Step 132,FIG. 10). Accordingly, address modifier 87 uses the following equationto convert x to x', and y to y'.

    x'=x modulo M; y'=y modulo N                               (Equation VIII).

It should be noted that for the likely case that M_(mm) and N_(mm) arepowers of 2, address modifier 87 would simply use the low order bits ofx and y. After this conversion, address modifier 87 will feed a modifiedaddress x', y' into dither template memory 82, in which d<x',y'> valueshave already been stored by phase adjuster 98.

In response to the x',y' address, dither template memory 82 will outputthe corresponding d<x',y'> value stored in the row-column addresscorresponding to x',y' (Step 134, FIG. 10). That d<x',y'> value is sentto adder 85, which adds d<x',y'> to IL<x,y>, which is the specific inputlevel value of the input cell 26 in input array 24, shown on FIG. 1, ataddress x,y (Step 136, FIG. 10). The sum of those two values is S whichis forwarded to quantizer LUT 86 (Step 138, FIG. 10). As discussedabove, LUT generator 80 will have already stored OL values in thelocations for which S operates as an address. Accordingly, S will accessa particular address location depending on the specific S valueresulting in quantizer LUT 86 outputting the appropriate OL<x,y> value(Step 142, FIG. 10) to the output device 30 on FIG. 1.

At this point it can be noted that the two addends of adder 85 - - -namely the dither template values, d<x',y'>, and the input levels,IL<x,y>- - - are finite numbers. In other words, in a particularimplementation, there will be a finite number of possible, dithertemplate values, and a finite number of possible input levels.Correspondingly, the addition of all possible dither template valueswith all possible input levels would yield a finite number of unique,possible S values.

Referring now to FIG. 11, a table is provided which shows the range ofinput levels for the example discussed in connection with FIGS. 6through 11, the total number of input levels falling within thoseranges, and the corresponding perceived output levels. The perceivedoutput levels are the ones which are achieved by passing every inputlevel from IL=0 to IL=255 in combination with every address from<x,y>=<0,0> to <7,7> through IP 40. As shown in FIG. 11, there are 4true levels, and 9 intermediate levels which are the effective resultsof the dithered average. These numerical averages are meaningful in thata person viewing output device 30 would visually average the outputpatterns and perceive an image level equivalent to the average valueindicated.

Referring back to the discussion of FIGS. 4 and 5, in those examples thecells of the dither templates are discussed as if they could actually beshaded. As stated in that portion of the discussion, this is not so.Rather, it is the cells of the output device, such as cells 34 of outputarray 32 shown on FIG. 1 that are actually shaded in order to produce anoutput image. On the other hand, through the image processing techniquediscussed in connection with FIGS. 6 through 11, it has been explainedhow the values in the dither template are indirectly mapped to thedetermined output levels in the output array. In other words, throughthe technique of the present invention, the value in a given cell in thedither template will indirectly determine the output level in a givencell in the output array. As seen by following the processing of thevalues, T<x',y'> is made up of the original dither template values,which eventually get modified in dither normalizer 96 and phase adjuster98 before storage in dither template memory 82. The values stored indither template memory 82 are then added to the input levels, IL<x,y>,and the sum, S, then operates as an address to quantizer LUT 86.Quantizer LUT 86 then outputs the appropriate level for the output cellwhich corresponds to the level of the input cell from which IL<x,y>originated. In this regard, although the cells of the dither templateare themselves not shaded, the values in the cells of the dithertemplate do indirectly determine the levels, or shading, of the cells ofthe output array in the manner discussed.

C. Two Level Dithering System with Comparator

Although first embodiment of the present invention has been discussed inconnection with a system which can dither to any number of outputlevels, in the event that the number of output levels equals 2, i.e.NOL=2, a different implementation of the multi-level processing systemis possible. As discussed above, an output device which is capable ofrepresenting only two levels is a bi-tonal device. In this particularembodiment, there may be any number of input levels provided they aregreater than two. In other words, the output device is bi-tonal, but theinput devices are monochromatic, or color devices.

Referring now to FIG. 12 for the alternate embodiment of the imageprocessor portion of the imaging system, IP 140 receives the same basicinputs, has similar components, and processes those inputs in a similarmanner as IP 40, discussed in connection with FIGS. 1, and 6 through 11.Thus, FIG. 1 provides an overview of the implementation of IP 140 in animaging system provided IP 140 was substituted in place of IP 40.

Given that the operation of IP 140 of FIG. 12 is similar to theoperation of IP 40 of FIGS. 6 and 7, the discussion of FIG. 12 will notrepeat the detailed discussion of FIGS. 6 and 7, but will focus upon thedifferences between IP 40 and IP 140. The major differences are that inplace of an adder 85, there is a comparator, and the quantizer LUT 86has been eliminated. Also, in FIG. 12, the block elements are numberedso that they correspond to their respective block elements in FIG. 6;however, the corresponding block elements in FIG. 12 are numbered in the100's to distinguish them.

In addition to the block diagram of FIG. 12, flow diagrams of the methodof implementing the technique in conjunction with the comparator areprovided on FIGS. 13 and 14.

In FIG. 12, LUT generator 180 outputs the d<x',y'> values which arestored in dither template memory 182, and it also computes Δ_(Q), (Step310, FIG. 13), and Δ_(d) (Step 312, FIG. 13), as explained above inconnection with LUT generator 80 of FIGS. 6 and 7. Given that there isno quantizer LUT in this particular implementation, LUT generator 180does not need to compute quantized values and fill a quantizer LUT 86,as discussed in connection with FIGS. 6 and 7.

After LUT generator 180 computes Δ_(Q) and Δ_(d) , it tiles the dithertemplate into the dither template memory 182, if necessary (Step 316,FIG. 13). LUT generator 180 normalizes the dither template values (Step320, FIG. 13), phase adjusts the dither template values (Step 322, FIG.13), and stores the results in dither template memory 182 (Step 324,FIG. 13). This is, of course, the same as the procedure discussed inconnection with FIGS. 6 through 11.

Next, after the values are stored in dither template memory 182, the runtime portion of the system, comparator run time system (CRTS) 181, isprepared to operate. With the dither template values stored in dithermatrix memory 182 (Step 330, FIG. 14), address modifier 287 receives thex,y address of the input cell. Like address modifier 87 of FIG. 6,address modifier 187 will translate the address to x',y' (Step 332, FIG.14). In response to the address, dither template memory 182 will outputthe accessed d<x',y'> value to comparator 190 (step 334, FIG. 14). Thevalue is transferred to comparator 190 from another part of imagingsystem 20, such as input device 22 shown in FIG. 1. Comparator 190 thenperforms the following comparison and outputs the appropriate OL<x,y>value on the basis of that comparison (Step 336, FIG. 14). The operationperformed by comparator 190 is as follows:

    If IL<x,y>>d<x',y'>,

    then OL<x,y>=1,

    else OL<x,y>=0.                                            (Equation IX.)

Depending upon the results of the comparison, IP 140 will output thecorresponding OL<x,y> (Step 340, FIG. 14).

Thus, IP 140 achieves the same output as the generally applicable IP 40,discussed in connection with FIGS. 6 through 11, provided the outputimage is bi-tonal, or NOL=2.

D. Multilevel Dithering System with Single Memory

In yet another embodiment of the image processor, the run time portionof the system uses a single memory device. This single memory approachis faster than the embodiments which two memory devices in the run timesystem, as discussed above; however, the size of the memory requirementsare considerably greater. This particular implementation requires thatthe row dimension, M_(mm), and the column dimension, N_(mm), of thedither template memory 482, as shown in FIG. 15, must each be a power of2.

Referring now to FIGS. 15 and 16, IP 440 includes LUT generator 480,which receives the same inputs and operates in the same manner as LUTgenerator 80, discussed in connection with FIGS. 6 through 11. Asdiscussed above, FIG. 1 could provide the overview of the implementationof IP 440 in an imaging system 20, provided IP 440 is substituted inplace of IP 40. IP 44O includes single memory table value determiner(SMTVD) 481, which contains the same block elements as TMRTS 81,discussed above. The block elements of FIG. 15 are numbered so that theycorrespond to their respective block elements in FIG. 6; however, thecorresponding block elements in FIG. 15 are numbered in the 400's todistinguish them.

To the extent that the operation of LUT generator 480 and SMTVD 481operate the same as the respective block elements discussed above, thedetails of their manner of operation will not be repeated. Rather, itwill be understood that LUT generator 480 outputs d<x',y'> values whichare stored in dither template memory 482, and LUT generator 480 outputsQ<S> values which are stored in quantizer LUT 486. The method by whichthese values are generated is identical to the process detailed inconnection with the discussion of FIGS. 6 through 11. It should also beunderstood that the values for d<x',y'> and Q<S> would have beengenerated by LUT generator prior to the processing and outputting ofvalues by address/level generator 490, the operation of which is to bedetailed next.

After d<x',y'> and Q<S> have been stored (Step 510, FIG. 16), FIG. 15shows address/level generator 490 receiving the inputs NIL, M_(mm),N_(mm) from imaging system 20 and address/level generator 490 outputsx', y' and IL. The function of address/level generator 490 is to produceall of the possible combinations of x', y' and IL values, so that thesingle memory device of the run time portion of the system is able tostore all possible combinations of row/column addresses of dithertemplate memory 482 and all possible input levels at those addresses.

Referring now to FIG. 17, an address/level generator 490 is shownincluding a counter set-up circuit 492. Counter set-up 492 is a circuitdevice which is responsive to signals which correspond to the values forM_(mm), N_(mm), and NIL. Counter set-up 492 makes sure that theindividual counters, 493 through 495, are large enough to count to themaximum values given by M_(mm), N_(mm), and NIL. Also, counter set-up492 initializes the individual counters in the beginning of theoperation so that their respective initial values are zero. Afterinitialization of the counters, counter set up 492 starts clock 496which will begin incrementing the counters.

A simple example will show how address/level generator 490 operates.Assume that dither template memory is an 8×8 array and there are 256input levels. Accordingly, x-counter 493 will need 3 address bits forrepresenting the 8 columns, M_(m) ; y-counter 494 will need 3 addressbits for representing the 8 rows, N_(mm) ; and IL-counter 495 will need8 bits for representing the 256 input levels, IL. After initialization,counters 493, 494, and 495 will output their respective values; namelyx-counter 494 outputs x', y-counter 495 outputs y', and IL-counter 496outputs IL. All such values are output to SMTVD 481, shown on FIG. 15,prior to the first incrementation by clock 496, and thereafter thesevalues are output after each incrementation by clock 496.

Before the first incrementation by clock 496, x'=000, y'=000, andIL=00000000. Also before incrementation, address/level generator 490would then transfer these values to SMTVD 481 so that it could use theinputs to compute the values to be stored in single LUT 491, shown onFIG. 15. Next, clock 496 will increment x-counter 493 by one, so thatthe values output by address/level generator 490 are: x'=001, y'=000,and IL=00000000. Likewise, these values are transmitted to SMTVD 481, asare all of the values for x', y', and IL after they are changed. Afterthe second incrementation by clock 496, the outputs of address/levelgenerator 290 are: x'=010, y'=000, and IL=00000000. Thus, theincrementation will continue until x-counter 493 reaches an output of111, at which point it will overflow (OF) for the first time.

As shown on FIG. 15, the overflow signal of x-counter 493 is theincrement signal for y-counter 495. Therefore, when x-counter overflowsfor the first time, it then increments y-counter 495 for the first time.At that point the outputs will be x'=000, y'=001, and IL=00000000. Asclock 496 continues to increment x-counter 493, it will eventuallyoverflow for a second time, once again incrementing y-counter 495, atwhich point the outputs will be x'=000, y'=010, and IL=00000000.

Through the incrementation process y-counter 495 will eventuallyoverflow and increment IL-counter 496 for the first time, the overflowof y-counter 495 being the input for IL-counter 496 as shown in FIG. 17.After the first overflow, the outputs will be x'=000, y'=000, andIL=00000001. Finally, after IL-counter 495 is made to overflow throughincrementation, its overflow will stop clock 496, and the incrementationprocess will be completed.

As indicated, at each stage of the incrementation process, x', y' and ILare transferred to SMTVD 481 for processing. Therefore, through theoperation of address/level generator 290, all of the possiblecombinations of row-column addresses and all possible input levels atthose addresses can be generated and forwarded to SMTVD 281 forprocessing (Step 512, FIG. 16.)

Referring back to FIG. 15, x' and y' are transferred to address modifier487 by address/level generator 490. As discussed above, in connectionwith address modifier 87 shown in FIG. 6, the purpose of addressmodifier 87 is to adjust the x,y address of the input from input device22 in the event that input array 24 of FIG. 1 is larger than thedimension of the dither template memory. In the embodiment of the imageprocessor shown in FIG. 15, IP 440, address/level generator 490 alreadyoutputs x', y' (Step 514, FIG. 16), thereby eliminating the need for aseparate address modifier. In response to x', y' dither template memory482 outputs d<x',y'> values which are transmitted to adder 485 (Step516, FIG. 16).

Address/level generator 490 also outputs the IL<x,y> value associatedwith x', y', and together the values are transmitted to adder 285 (Step520, FIG. 16). In response, adder 285 adds the given d<x',y'> values totheir corresponding IL values to form the sum, S (Step 521, FIG. 16).Similar to the discussion of FIGS. 6 through 11, S is output as theaddress to the look up table of quantizer LUT 486 (Step 522, FIG. 16).Accordingly, as address/level generator 490 transmits each x', y', andIL value to SMTVD 481, SMTVD 481 will output OL values, which correspondto each IL<x,y> value transmitted.

As shown in FIG. 15, the OL values output by quantizer LUT 486 of SMTVD481 are transmitted to single LUT 491, which is a memory device. As OLvalues are transmitted they are stored in sequential addresses in singleLUT 481 (Step 524, FIG. 16). For example, the first set of values outputby address/level generator 490, before clock 496 incremented thecounters, is x'=000, y' =000, and IL=00000000. Thus, the OL computed bySMTVD 481 in connection with this set of values would be stored in thefirst address location of single LUT 491, having a binary address of00000000000000, for example. When the second set of values output byaddress/level generator 490 is transmitted to SMTVD 481, the computed OLwould be stored in the second memory location, having a binary addressof 00000000000001, and so on.

Thus far, the operation of IP 440 has addressed the computation andstorage of values in the single memory device of the run time portion ofthe system, which is a look up table, single LUT 491. In this singlememory implementation, all of the operations prior to the computing andfilling of single LUT 491 with the OL values does not need to be done atany particular speed. Rather all the block elements compute the valuesand fill single LUT 491 prior to the time that imaging system 20, shownin FIG. 1, translates the input pixels to output pixels during real timeoperation. After the values are computed and stored in single LUT 491,imaging system 20 is then in a position to translate the input pixels tooutput pixels through the real time operation of single memory run timesystem (SMRTS) 497, shown as a dashed line block on FIG. 15.

Along with the block elements of FIG. 15, FIG. 18 provides a flowdiagram illustrating the method by which the operation of SMRTS 497results in the outputting of output levels which correspond to the inputlevels transmitted to SMRTS 497. SMRTS 497 includes single LUT 491 andcollective address generator 498. As discussed above, single LUT 491 isa memory device which stores all of the output levels computed by SMTVD481 (Step 530, FIG. 18). On the other hand, collective address generator498 receives x, y addresses and their corresponding IL<x,y> from inputdevice 22 during real time operation. Collective address generator 498converts this information into an address that is then used to accesssingle LUT 491 (Step 532, FIG. 18).

More particularly, collective address generator 498 uses only the leastsignificant bits of the x, y address which are necessary to identify anaddress location. For example, in the embodiments discussed above, thedither template memory is an 8×8 array, which therefore requires 3 bitsfor column addressing, and 3 bits for row addressing. In such aconfiguration, collective address generator 498 would use only the 3least significant bits of the x address value coming from an inputdevice, such as input device 22 shown on FIG. 1, and the 3 leastsignificant bits of the y address value coming from the input device. Inother implementations in which the dither template memory has adifferent size, that size would correspondingly determine the number ofleast significant bits of the x, y address used by collective addressgenerator 498.

Collective address generator 498 bundles the necessary least significantbits of the x, y address together with the actual input level at thataddress, IL<x,y>, to produce a collective address which is thentransmitted to single LUT 491 (Step 534, FIG. 18). Given that LUTgenerator 480, address/level generator 490, and SMTVD 481 would havecollectively generated and computed output levels for all possiblecombinations of x, y addresses and input levels, and stored those valuesin single LUT 491, the address output by collective address generator498 need only access the particular address in single LUT 491 to have itoutput the OL<x,y> which corresponds to IL<x,y,> (Step 536, FIG. 18) .

Using one implementation as an example, if the least significant bits ofthe x and y address are respectively 010 and 101, and IL<x,y> is00001111, collective address generator 498 will access address01010100001111 in single LUT 491. In addition, the storage of values insingle LUT 491 will be such that at that particular address locationwill be the OL value computed by SMTVD 281 when address level generator490 had transmitted to it the values: x'=010, y' =101, and IL=00001111.

Comparing the single memory implementation to the two memoryimplementation discussed above, the single memory system can operatefaster than the two memory system. During real time operation, SMRTS497, shown on FIG. 15, requires only the generation of a collectiveaddress by collective address generator 498, which then operates as anaddress to single LUT 491. That address causes single LUT 491 to thenoutput OL<x,y>. With respect to the two memory device implementation,during real time operation TMRTS 81, shown on FIG. 6, requires thegeneration of the modified address, through address modifier 87. Thataddress accesses dither template memory 82, which in turn outputsd<x',y'> to adder 85. Adder 85 adds d<x',y'> to IL<x, y> to generate thesum, S, which accesses a memory location in quantizer LUT 86, whichfinally outputs OL<x,y>. Accordingly, the generation of OL<x,y> valuesduring real time operations involves more steps, and therefore takeslonger, for the two memory implementation, shown on FIG. 6, than for thesingle memory implementation, shown on FIG. 15.

On the other hand, the single memory implementation requiresconsiderably more memory than the two memory implementation. Forexample, if in the single memory implementation, shown in FIG. 15, the xvalue required 3 bits of data, y required 3 bits, IL<x,y> required 8bits, and 4 bits of data are required for the number of output levels,the memory required for single LUT 491 would be 2¹⁴ ×4 bits=65536 bitstotal. Assuming the same parameters for the two memory implementation,shown in FIG. 6, dither template memory 82 would require 2⁶ ×8 bits andquantizer LUT 86 would require 2⁹ ×4 bits, for a total of 2560 bits.

Thus, for the values of the example discussed above, the memoryrequirements for the two memory implementation are approximately 25times smaller than the memory requirements for the single memoryimplementation; however, the two memory implementation is slower thanthe single memory version.

E. Multilevel Dithering System with Bit Shifter

Thus far the embodiments of the multi-level image processing systems andtechniques of the present invention have been premised upon theunderstanding that the input device could have any number of inputlevels. In such embodiments, the number of input levels are a fixedparameter given to the image processor by the imaging system, and thatinformation, along with other information, is processed by the imageprocessor to determine the output levels.

In yet another embodiment of the image processor, it is possible to usea bit shifter in place of the quantizer LUT. The embodiment is based onhaving the average number of unique "S" values which can be produced byan adder, such as adder 85 shown in FIG. 6, and which `map to` a singleoutput level, as the meaning of the term `map to` is hereinbelowrefined, equal to an integer power of two.

Referring momentarily back to the discussion surrounding Equation V,there it was determined that the average number of unique S values whichcan be produced by adder 85 and which map to a single, given outputlevel could be determined by computing the average number of unique Svalues that address the same output level stored in quantizer LUT 86.

In the bit shifter implementation there is no quantizer LUT; however,there is a bit shifter which operates in place of the quantizer LUT. Aswill be detailed below, the output of the bit shifter is the outputlevel produced by the image processor. Accordingly, in the bit shifterembodiment a unique S value is considered to map to a single, givenoutput level if, after that S value is produced by the adder andprocessed by the bit shifter, the resulting value of S is equal to thegiven output level.

For example, assume a given bit shifter is programmed to shift incomingbinary data four bits to the right. The results of that bit shifterprocessing five S values are shown in Table D.

                  TABLE D                                                         ______________________________________                                        S value      Shifted S value                                                  ______________________________________                                        00110101     0011                                                             00111111     0011                                                             00110000     0011                                                             11000101     1100                                                             11001111     1100                                                             ______________________________________                                    

In this particular example, three of the unique S values would beconsidered to map to the output level 0011 because their resultingvalue, after processing by the bit shifter, is equal to the given outputlevel, 0011. On the other hand, two of the unique S values would beconsidered to map to the output level 1100 because their resulting valueis equal to output level 1100.

As discussed in connection with the embodiment of the invention shown inFIG. 6, in order to determine what the average number of unique S valuesthat map to a given, unique output level are, it is necessary todetermine the finite numbers of possible addends to be added by theadder, and compute all of the possible S values. After the total numberof possible, unique S values are determined, they must be processed bythe bit shifter to determine the number of S values that map to a givenoutput level. Therefore, in the bit shifter implementation, Δ_(Q) isunderstood to represent the average value of the number of unique Svalues that map to a single, given, output level, if all possible Svalues were produced by an adder and shifted by the bit shifter.

Accordingly, the term map to in the context of the bit shifterimplementation is somewhat refined relative to the other specificembodiments discussed above.

Recalling that Δ_(Q) is defined as being equal to the average number ofunique S values which can be produced by the adder and which map to asingle, given output level and further recalling that the average numberof unique S values which can be produced by the adder and which map to asingle, given output level is equal to an integer power of two, thesetwo features of the bit shifter implementation can be summarized in theexpression:

    Δ.sub.Q =2.sup.R,                                    (Equation X).

where R is the number of bits the bit shifter shifts to the right.

In light of Equation X, in particular embodiments of the bit shifterimplementation, the bit shifter may have to have the freedom to assignthe range of input levels which will be transmitted to the imageprocessor by other components within the imaging system, such as inputdevice 22 shown in FIG. 1.

It should be noted that although most imaging systems are designed sothat the number of input levels are fixed, in the case of some imagingsystems that generate synthetic graphics, the number of input levels canbe set to any number. In addition, even conventional imaging systemswhich have a fixed number of input levels can be made to have any numberof assignable levels through the implementation of an image adjustmentsystem. As will be detailed below in the section heading "ImageAdjustment System", an image adjustment system can translate any numberof raw input levels to a greater or lesser number of adjusted inputlevels, as needed.

Before proceeding with the more detailed discussion of the bit shifterembodiment, it should be noted that if in a given imaging systemEquation X can be satisfied, possibly through the implementation of animage adjustment system, then a bit shifter can substitute in place ofquantizer LUT 86, shown on FIG. 6. This is because it has been foundthat if quantizer LUT 86 is segmented so that the number of unique Svalues that map to each output level is equal to a power of 2 (i.e.2^(R)), then an equivalent way to achieve quantization is by shiftingeach given S value R bits to the right. This shifting will produce theappropriate output level value. Thus, if the system has the capabilitiesdiscussed above, the bit shifter embodiment simplifies the overallsystem, especially if implemented in hardware.

Referring momentarily back to FIG. 1, the objective of the bit shifterimplementation is the same as the previous implementations of the imageprocessing technique. Namely, in FIG. 1 during operation input device 22will transfer to IP 40 the input level occurring at a given input cell,IL<x,y> and IP 40 will translate that input level to a correspondingoutput level occurring at a given output cell OL<x,y>. That output levelis then transmitted to an output device 30.

Now referring to FIG. 19, an alternative IP 740 is shown which could besubstituted in place of IP 40 shown in FIG. 1. IP 740 includes a systemdata generator 720 and bit shifter run time system 781 (BSRTS), which isshown in dashed lines. As in previous embodiments of the presentinvention, in those instances in which there is a correlation betweenthe reference numbers of block elements in FIGS. 19 and 20, andpreviously described embodiments of the invention, the reference numberswill correlate except that the reference numbers in FIGS. 19 and 20 arein the 700's. One notable difference is that the quantizer LUT 86 ofFIG. 6 has been replaced with shifter 722 in FIG. 19.

BSRTS 781 includes a dither template memory 782, which is initializedwith values d<x',y'> by data system generator 720. In addition, datasystem generator 720 also furnishes a signal "R" to shifter 722, inwhich R corresponds to the number of bits that numbers transmitted toshifter 722 should be shifted. In this particular embodiment, shifter722 will shifter data R bits to the right.

BSRTS 781 further includes an address modifier circuit 787, which isused to convert addresses x,y of an input cell 26 of input device 22,shown on FIG. 1, to addresses x',y' which are applied as an address toaccess the values stored in dither template memory 782. The output ofdither template memory 782, d<x',y'>, are fed to an adder 785. Adder 785is also fed an input level, IL<x,y>, for the given input cell 26, andthe two values are added by adder 785 to produce a sum value, S. In thisparticular implementation, S is then processed by shifter 785, inparticular, the number S is shifted R bits to the right. The bit shiftednumber is then output by shifter 722 as the output level OL<x,y> whichcorresponds to IL<x,y>. As in prior implementations, OL<x,y> is fed tothe output device 30 of FIG. 1.

In this embodiment, system data generator 720 determines the d<x',y'>values which are stored in the dither template memory 782, and thevalues of R and NIL. Data system generator 720 does not need to run atany particular speed since it computes these values before imagingsystem 20 starts translating input pixels to output pixels during realtime operation. Thus, after data system generator 720 determines andstores these values, it will resume activity only if some of the imagingsystem 20 parameters change.

BSRTS 781 is the portion of IP 740 which operates in real time, andduring operation it is constantly receiving input values IL<x, y>, frominput array 2 4, shown in FIG. 1, and processing them into correspondingoutput values, OL<x,y>, in output array 34.

IP 740, and in particular, data system generator 720 is fed by signalscorresponding to: the number of output levels, NOL; the number of dithertemplate levels, NTL; the dither template order, T<x',y'>; phase₋₋ x andphase₋₋ y values; the dimensions of the dither template memory, M_(mm)×N_(mm) ; and the number of bits of the input level, B. Address modifier787 is fed the x and y address values for a given input cell, x,y, andadder 785 is fed the actual input level of the given input cell at thex, y address, IL<x,y>.

It should be noted that unlike prior implementations, in this embodimentIP 740 is not fed a signal which corresponds to the number of inputlevels, NIL, of the input device. Instead, data system generator 720uses the inputs provided to it to compute the NIL, which is fed back toinput device 20 of FIG. 1. With the assignment of NIL by IP 740, inputdevice 20 will then transmit the correct range of input levels to IP 740during real time operation.

Although it may appear initially that there are no system parametersaffecting the number of input levels which the data system generator 720may assign, in fact the number of bits, B, of the input level does forcea type of limitation. More particularly, imaging system 20 of FIG. 1will assign a number of input levels such that:

    2.sup.B-1 <NIL≦2.sup.B                              (Equation XI).

Accordingly, IP 740 will assign a number of input levels which, at aminimum, takes advantage of all of the bits allocated for the inputlevels, but does not exceed the maximum number of levels which can berepresented by the given number of bits.

By combining Equation I with Equation X it is seen that:

    Δ.sub.Q =2.sup.R =(NIL-1)(NOL-1).

Using this relationship, and Equation XI, a solution for R is providedby:

    R=int}log.sub.2 (2.sup.B -1)/(NOL-1)}                      (Equation XII).

Referring now to FIG. 20, data system generator 720 is shown to includea variables determiner circuit 790 which is fed by signals correspondingto NOL, NTL, and B to provide data signals representing: R, the numberof bits shifter 722 will shift incoming data to the right's Δ_(d), thesubdivisions of the quantization levels; Offset, the dimension of theoffset at the endpoints of the input levels; and NIL, the number ofinput levels transmitted to IP 740 by input device 20 of FIG. 1. Thevariables determiner circuit uses any conventional arithmetic circuit toprovided these values by solving the equations discussed below.

System data generator 720 is shown to further use a memory device, whichcould be the same memory device used for dither template memory 782, forthe temporary storage of a suitable dither template. An exemplarytemplate will be discussed in conjunction with FIG. 22A. Dither templatevalues, T<x'y'>, are shown stored on FIG. 20 as reference numeral 753.They are fed to dither normalizer 796 which adjusts the dither templatevalues so that they are made to be symmetrically distributed between 0and the average value of the number of unique S values that map to asingle, given output level, if all possible S values were produced byadder 785 and shifted by shifter 722.

The output from the dither normalizer 796 as stored is shown byreference numeral 797, and these values are fed into phase adjustercircuit 798 along with phase₋₋ x, phase₋₋ y, and M_(mm) ×N_(mm) signals.Phase adjuster 798 processes the values by spatially shifting theelements within the dither matrix. Thus, the elements of the dithermatrix which have a particular location within the matrix prior to phaseadjustment, are adjusted to a different location within the dithermatrix on the basis of the phase₋₋ x and the phase₋₋ y values. Theresulting values, d<x',y'> are then stored in dither matrix memory 782,shown on FIG. 6.

In order to illustrate how system data generator 720 operates, a simpleexample will be developed through which actual values will be assignedto the various input signals to see how those values are processedthrough IP 740. As with previous examples, small numbers are used forthe purpose of illustrating the principles underlying the embodiment ofthis invention. In addition to FIG. 20, FIG. 21 includes a flow diagram,showing the steps of the process, which can be read in conjunction withFIG. 20.

In this example, it will be assumed that the following signals areprovided to IP 740 by the imaging system 20 of FIG. 1.

                  TABLE E                                                         ______________________________________                                                 NOL = 4                                                                       NTL = 4                                                                       Element ordering is:                                                                      1 2                                                                           3 0                                                               M.sub.mm = 8                                                                  N.sub.mm = 8                                                                  Phase.sub.-- x = -1                                                           Phase.sub.-- y = -1                                                           B = 9                                                                ______________________________________                                    

As shown in FIG. 20 variables determiner 790 receives NOL and B and usesthat information to compute R (Step 810, FIG. 21) using Equation XII,above. The signal representing the R value is then forwarded to shifter722 so that it will be able to shift the numbers forwarded to it byadder 785 by R bits to the right (Step 811, FIG. 21).

In addition to determining R, variables determiner 790 also computesΔ_(d) (Step 812, FIG. 21), which is the range of input levels which arecovered by a given output level. Variables determiner 790 computes Δ_(d)using the equation:

    Δ.sub.d =2.sup.R /NTL                                (Equation XIII. )

Finally, variables determiner 790 computes the NIL for input device 22of the imaging system 20 of FIG. 1 (Step 814, FIG. 21). This isaccomplished using the equation:

    ______________________________________                                        NIL =         (NOL - 1)2.sup.R, if Δ.sub.d > 1, and                                   (NOL - 1)2.sup.R + 1, if Δ.sub.d ≦ 1.              (Equation XIV.)                                                               ______________________________________                                    

After this computation by variables determiner 790, NIL is transmittedback to input device 22 so that it is able to provide input levelsconsistent with the limits assigned by IP 740 (Step 816, FIG. 21).

Using the specific values provided in Table D and Equations XII, XIII,and XIV variables determiner 790 would compute the following values:

R=7;

Δ_(d) =32.00; and

NIL=384, where the input levels range from 0 through 383.

Still referring to FIG. 20, system data generator 720 also receives asan input the dither template, T<x',y'>, which can be expanded to fillthe entire dimension of the dither matrix memory 782, in the mannerdiscussed above (Step 820, FIG. 21). FIG. 22A shows the dither templateof Table E in its fully expanded form. As shown in FIG. 20, dithertemplate, T<x',y'>, is combined with Δ_(d) in dither normalizer 796 tonormalize the dither template values by symmetrically distributing thedither template values between 0 and the average value of the number ofS values that map to a single, given output level, if all possible Svalues were produced by adder 785 and shifted by shifter 722. (Step 822,FIG. 21). In this particular embodiment dither normalizer uses theequation:

    D<x',y'>=int{Δ.sub.d (T<x',y'>+1/2)}                 (Equation XV.)

The resulting dither template values after they are run through dithernormalizer 796 are shown on FIG. 22B.

Finally, in phase adjuster 798 the D<x',y'> values are spatially shiftedwithin the dither template memory, including the wrapping of the rightside with the left and the bottom with the top, discussed above (Step824, FIG. 21). Phase adjuster 798 uses the values for phase₋₋ x, phase₋₋y, M_(mm), and N_(mm). At this stage of the technique, there is a twodimensional, spatial shift of the elements within the dither matrix.Thus, the elements of the dither matrix which have a particular locationwithin the matrix prior to phase adjustment, are adjusted to a differentlocation within the dither matrix on the basis of the phase₋₋ x and thephase₋₋ y values.

In the embodiment shown on FIG. 20, the D<x',y'> values, phase₋₋ x,phase₋₋ y, M_(mm), and N_(mm) are combined in the following equation forthe purpose of outputting d<x',y'>, which is the final value that isstored in dither template memory 782 (Step 826, FIG. 21). The equationis:

    d<x',y'>=D<(x'+phase.sub.-- x)modulo(M.sub.mm), (y'+phase.sub.-- y)modulo(N.sub.mm)                                        (Equation XVI).

FIG. 223 shows what the values stored in dither template memory 782would be for the exemplary values of Table E.

With the values for R, NIL, and d<x',y'> having been computed,transmitted, and stored in their respective locations within imagingsystem 20 (Step 840, FIG. 23), BSRTS 781 is in a position to beginreceiving input levels from input device 22, shown in FIG. 1, andtranslating them to output levels for registration by output device 30during real time operation. Referring back to FIG. 19, a more detailedexplanation of the real time operation of IP 740 can now be provided.

During operation address modifier 787 receives the x,y address of aspecific input cell 26 from input device 22, and it adjusts that addressto x',y', using Equation VIII, discussed above, to access dithertemplate memory 782 (Step 832, FIG. 23). In response to the x',y'address, dither template memory 782 will output the correspondingd<x',y'> value stored at x',y' to adder 785. (Step 834, FIG. 23). Thatd<x',y'> value gets added to IL<x,y> by adder 785 (Step 836, FIG. 23),and the resulting sum, S, is forwarded to shifter 722 (Step 840, FIG.23). As indicated above, shifter 722 will then shift the binary numberS, R bits to the right (Step 842, FIG. 23). The resulting shifted binarynumber is then output by shifter 722 as OL<x,y> (Step 844, FIG. 23).OL<x,y> is then output to output device 30 as the output level, OL<x,y>,which corresponds to the input level, IL<x,y>.

Referring now to FIG. 24, a table is provided which shows the range ofinput levels for the example discussed in connection with FIGS. 19through 23. FIG. 24 shows the range of input levels, the total number ofinputs, and the perceived output levels achieved by passing every inputlevel from IL=0 to IL=383 in combination with every address from<x,y>=<0,0> to <7,7> through IP 740. As shown on FIG. 24, there are 4true levels, and 9 intermediate levels which are the effective resultsof the dithered average. Similar to the discussion in connection withFIG. 11, above, these numerical averages indicate that a person viewingoutput device 30 would visually average the output patterns and perceivean image level equivalent to the average value indicated.

F. Image Adjustment System

In the embodiments of the imaging system 20 discussed thus far, theimage processor, such as IP 40 shown on FIG. 1, receives input levels,IL<x,y>, which are translated into output levels, OL<x,y>. In yet afurther embodiment of the imaging system 20 of the present invention, animage adjustment system (IAS) circuit may be used in conjunction withthe previously discussed image processors, such as IP's 40, 140, 440 and740.

The purpose of the IAS is to take the "raw" input levels, RIL<x,y>, ofan input device, such as input device 22 shown on FIG. 1, and translatethose raw input levels into "adjusted" input levels, simply referred toas IL<x,y>. In this context, the term "raw" refers to the input levelwhich is input into the IAS, and the term "adjusted" refers to the inputlevel output by IAS. Through this approach, an improved output image canbe produced by the imaging system 20. Due to the method by which the IASis implemented, the translation of the raw input levels to adjustedinput levels is accomplished very quickly, as will be detailed below.

Additionally, the raw input levels are the levels that are fixed byother parameters of imaging system 20, such as the number of actualinput levels produced by input device 22. On the other hand, adjustedinput levels are assigned by imaging system 20, and are not dictated byother system parameters. Therefore, the adjusted input levels may bevaried by imaging system 20, and the significance of this feature willbe further discussed below.

Referring to FIG. 25, which is based on FIG. 1, an imaging system 20 isshown to include an input device 22 coupled to an output device 30through an IP 40. In FIG. 26, IP 40 includes IAS 1020. IAS 1020 has anumber of adjustment interfaces 1021, which, in one embodiment, can bemanually adjusted by an operator to refine the output image of outputdevice 30.

For example, interfaces 1021 may be manipulated by a person to affectthe way in which IAS 1020 transforms raw input levels to adjusted inputlevels. Changes in the settings of the user interfaces, would result inchanging the output image produced in output device 30, shown on FIG.25. In addition to the user interfaces, IAS 1020 also receives signalinformation from other sensors or switches in imaging system 20.Together the information provided through those signals and the signalsprovided by the user interfaces are used to translate RIL<x, y> valuesto IL<x, y> values in the manner detailed below.

Before detailing an embodiment of IAS 1020, it is necessary to firstgenerally address the various ways by which IAS 1020 can be used torefine the raw inputs which it receives. This

explanation is best provided by beginning with a graphicalrepresentation of the way in which IAS 1020 converts raw input levels toadjusted input levels. As will be detailed below, the values that arecomputed in the IAS 1020 are eventually stored in an adjust LUT. Theadjust LUT is structured such that the input to the LUT is an RIL<x,y>,which operates as an address to the LUT. Thus, each RIL<x,y> transmittedto the adjust LUT will result in the outputting of a correspondingIL<x,y> by the adjust LUT.

FIGS. 26-35 provide graphical representations of how an input ofRIL<x,y> value, shown on the x-axis, will produce an output of acorresponding IL<x,y> value, shown on the y-axis. In these graphicalrepresentations, the correspondence is determined by the positioning ofthe transform line shown on each of the graphs in the respectivefigures. Consistent with the conventional method of reading x--y graphs,the transform line determines the exact IL<x,y> value on the y-axiswhich corresponds to a given RIL<x,y> value on the x-axis. As will bedetailed through FIGS. 26-35, changes in the positioning of thetransform line have the consequence of changing the mapping of RIL<x,y>values to IL<x,y> values.

For example, FIG. 26 provides a graph in which the x-axis represents anumber of raw input levels (NRIL) ranging from 0 to (NRIL-1), and they-axis represents a number of adjusted input levels (NIL), ranging from0 to (NIL-1). The x-axis is bisected by (NRIL-1)/2, and the y-axis islikewise bisected by (NIL-1)/2. In this particular illustration, NRIL isequal to NIL.

The graph of FIG. 26 further includes identity transform line 920, whichdiagonally extends across the graph and, by definition, has a"Steepness" equal to 0. Identity transform line 920 reflects that at theparticular setting of the image adjustment system each RIL<x,y> value istranslated to an identical IL<x,y> value. For example, RIL_(a) equalsIL_(a), showing that each raw input level has the exact same value asits corresponding adjusted input level. Thus, this particular setting oftransform line 920 defines the identity function, in which each RIL<x,y>value is translated to an identical IL<x,y> value.

Referring now to FIG. 27, a graph similar to FIG. 26 is provided. Inaddition to identity transform line 920, however, vertical line 922 andhorizontal line 924 are provided with vertical line 922 defined ashaving a Steepness of (+1), and horizontal line 924 having a Steepnessof (-1). The dashed transform lines 925, 927 show intermediate positiveand negative Steepnesses, with identity transform line 920 being thereference line against which positive and negative Steepness isdetermined. As shown, the intermediate positions are achieved bypivoting transform line 920 about point 929.

In several of the Figures, such as FIGS. 27, 29A, and 30A, there are anumber of transform lines that appear on one single graph. Consequently,from the graph it appears that a given RIL<x,y> value will map tomultiple IL<x,y> values. It should be noted that IAS 1020 will assignonly one IL<x,y> value to any given RIL<x,y> value. Those graphs onwhich multiple transform lines are included are not for showing themapping of a given RIL<x,y> value, but rather for illustrating anddefining the properties of the transform line, especially by means ofcontrasting one line on the graph to another.

FIG. 28 includes a graph which is similar to the graph of FIG. 27;however, FIG. 28 includes transform line 926, alone. As shown, becausethe Steepness setting is not in the identity position, the RIL<x,y>values are not necessarily mapped to identical IL<x,y> values. Forexample, on the graph RIL<x,y> values ranging from 0 to RIL, are allmapped to IL=0. Also, RIL<x, y> values ranging from RIL_(b) to (NRIL-1)are all mapped to (NIL-1). Consequently, a narrower range of values,namely RIL_(a) to RIL_(b), will encompass all of the IL<x,y> values from0 to (NIL -1). FIG. 28 also graphically shows how the adjustment of theSteepness setting affects the translation of RIL<x,y> values to IL<x,y>values by IAS 1020.

In order to describe the purpose of the Steepness variable, and othervariables which are discussed below, reference will be made to a numberof different imaging systems which use monochrome or color input oroutput devices. Before doing so, it should first be noted that in colorsystems, the color images are made up of a number of components. Forexample, in a luminance/chrominance color system, such as a YUV system,Y is one of the components, which is used to represent a luminancevalue. Additionally, there are two chrominance components, namely U andV, which are each used to represent saturation values. Thus, the YUVcolor system includes three components. In another example, such as acolor system in which data is represented in the RGB format, there arelikewise three separate components, namely, red (R) , green (G) , andblue (B) . Such color systems which have multiple components will have aseparate image adjustment system, such IAS 1020, implemented for eachone of the components. Using the YUV as an example, the Y component willhave its own IAS 1020, the U component will have its own IAS 1020, andthe V component will have its own IAS 1020.

Referring now to more detailed embodiments, if imaging system 20 uses amonochrome input device, the Steepness adjustment of IAS 1020 could beused to alter the contrast of the output image. For example, an inputimage which has low contrast because the range of all, raw input valuesis relatively small, may visually appear to be dull or flat. Whenprojected on an output device, the image can be improved by adjustingthe Steepness setting so that the small range of raw input levels areexpanded to a wider range of adjusted input levels to give the outputimage a richer, sharper appearance. Thus, in the monochrome inputdevice, the Steepness setting gives a greater or lesser degree ofcontrast.

On the other hand, in another example, the imaging system may use acolor input device which produces data in a luminance/chrominanceformat, such as the YUV format discussed above. As stated, Y representsa luminance value and U and V each represent chrominance values, andeach such component has its own IAS 1020. In such a color system, theSteepness setting of the image adjustment system of Y can be used todetermine the contrast of the output image. On the other hand, theSteepness settings of the image adjustment systems of U and V can beused to adjust the saturation of the output image. Although the imageadjustment systems for U and V are independent of one another, andtherefore may have different Steepness settings, it has been found thata desirable output image is produced from having the Steepnesses of theU and V values set the same.

In still another embodiment of a color system which produces data in theRGB format, the Steepness settings for the image adjustment systems forthe three components, R, G, and B, can be used to adjust the contrast ofthe output image. Again, although the three image adjustment systems mayhave separate Steepness settings, a desirable output image is producedwith all three Steepnesses set the same.

Referring momentarily back to FIG. 28, three additional terms which willbe significant in connection with the method by which the IAS 1020determines the translation of raw input levels to adjusted input levelsare defined. In particular, the point at which RIL<x,y> is first mappedto a non-zero number, moving from 0 to (NRIL-1) is defined as "Low".Additionally the point at which RIL<x,y> is first mapped to (NIL-1),moving from 0 to (NRIL-1) is defined as "High". For ease of reference,(NIL-1) is also referred to as "Top". The significance of these termswill be detailed below.

FIG. 29A includes a graph which is similar to the graph of FIG. 27. FIG.29A includes identity transform line 920, and includes the positioningof other transform lines on the graph for the purpose of defining"Xoffset". The graph of FIG. 29A shows Xoffset adjustments to the rightof identity are defined as positive (+), and Xoffset adjustments to theleft of identity are defined as negative (-). As shown, as Xoffset isadjusted the positioning of point 929 moves parallel to the x-axis, butretains a constant y-axis value equal to (NIL-1)/2.

As shown on FIG. 29A, identity transform line 920 is moved parallel tothe x-axis to illustrate two, new transform lines 930, 932. When point929 of transform line 930 has an x-axis value equal to (NRIL-1),transform line 930 is defined to have an Xoffset=(+1). Similarly, whenpoint 929 of transform line 932 has an x-axis value equal to 0,transform line 932 is defined to have Xoffset=(-1). The dashed transformlines 934, 936 show intermediate positive and negative Xoffsetpositions.

FIG. 29B includes a graph, which is similar to FIG. 28, showing thesingle transform line 940. Transform line 940 is the result of adjustingthe Xoffset of identity transform line 920, of FIG. 26, in the positivedirection. In this instance, the RIL<x,y> values from 0 to RIL_(a) aremapped to IL=0 while the remaining RIL<x, y> values, from RIL_(a) to(NRIL-1) are mapped to the values between 0 and IL_(y). Again, FIG. 29Bprovides a graphical illustration of how adjustments to Xoffset affectthe transformation of RIL<x, y> values to IL<x, y> values.

In an imaging system 20, which uses a monochrome input device 22 forexample, the Xoffset is redundant if the image adjustment system has aYoffset. As will be discussed below, in such a system, the Yoffset isused to adjust the brightness of the monochrome image, and the Xoffsetwould serve no particular function. Likewise, if imaging system 20produces data in an RGB format, Xoffset is also superfluous. In suchimage adjustment systems, a variable which is not needed can be set tozero.

On the other hand, as discussed above, if the input device 22 of imagingsystem 20 produces data in a luminance/chrominance format, such as theYUV format, then there will be a separate IAS 1020 for Y, U, and V. TheXoffset setting of the image adjustment system for the luminance, or Yvalue, is superfluous; however, the Xoffset settings of the imageadjustment systems for U and V can be used for the purpose of achievingso called "white balance control" of the output image.

As is known in the imaging art, certain input devices are calibratedbased on the assumption that the input image recorded under particularlighting conditions. For example, if a given video camera is calibratedfor daylight, but is used to record an input image illuminated by anincandescent light, the image may appear too reddish. In a color system,the Xoffset settings of the image adjustment systems of the chrominancecomponents are used to correct such color errors by adjusting thelocation of point 929 relative to the x-axis. Given that the chrominancecomponents of the raw input levels are transformed on the basis of thelocation of point 929, Xoffset thereby determines the color translation,and is used to achieve the proper white balance control.

Similar to the foregoing graphs, FIG. 30A shows identity transform line920, and a number of other transform lines used to define Yoffset. Asshown, Yoffset adjustments upward on the graph are defined as positive(+), and Yoffset adjustments downward are defined as negative (-). Asshown, as Yoffset is adjusted the positioning of point 929 of identitytransform line 920 moves parallel to the y-axis, but retains a constantx-axis value equal to (NRIL-1)2.

As shown on FIG. 30A, identity transform line 920 is moved parallel tothe y-axis to illustrate two, new transform lines 944, 946. When point929 of transform line 944 has a y-axis value equal to 0, transform line944 is defined to have a Yoffset =(-1). Similarly, when point 929 oftransform line 946 has a y-axis value equal to (NIL-1), transform line946 is defined to have a Yoffset=(+1). The dashed transform lines 950,952 show intermediate positive and negative Yoffset positions.

FIG. 30B includes a graph which is similar to FIGS. 28 and 29B,including the single transform line 954. Transform line 954 is theresult of adjusting the Yoffset of identity transform line 920, of FIG.26 in the positive direction. The RIL<x,y> values on FIG. 30B rangingfrom 0 to RIL_(x) are mapped to IL<x,y> values ranging from IL_(a) to(NIL-1). The remaining RIL<x,y> values, from RIL_(x) to (NRIL-1) , aremapped to (NIL-1) . FIG. 30B also provides a graphical illustration ofhow adjustments to the Yoffset setting affect the transformation ofRIL<x,y> values to IL<x, y> values .

In an imaging system 20 having the exemplary monochrome input device,the Yoffset could be used to adjust the brightness. This is because inthe monochrome system as point 929 is adjusted along the y-axis, agreater or lesser number of raw input levels are mapped to the lighteror darker adjusted input levels. Thus the brightness of the image may beadjusted by the Yoffset.

On the other hand, if imaging system 20 includes an input device 22based on the luminance/chrominance color system, the Yoffset settings ofthe two image adjustment systems for the chrominance components would besuperfluous, given that white balance control is achieved by adjustingthe Xoffset, as described above. However, the Yoffset of the imageadjustment system used for the luminance component can be used tocontrol the brightness of the output image.

Referring again to an imaging system 20 in which color is produced inthe RGB data format, the Yoffset settings of the image adjustmentsystems of each of the three components can be used to adjust thebrightness of the output image. Again, a uniform setting for all threeis preferred.

One of the features of input device 22 and output device 30 of imagingsystem 20, shown on FIG. 1, is that they may each have their ownrespective "sense". By definition, the "sense" of an input or outputdevice is the logical meaning that the given device ascribes to thebinary value 0. For example, the given "sense" of a monochrome inputdevice will determine whether that particular input device treats thevalue 0 as representing the highest or lowest value, such as black orwhite for example. Likewise, the sense of a bi-tonal or monochromeoutput device determines whether it treats the value 0 as representingthe highest or lowest value. A similar meaning relating to theassignment of values applies to the components of a color system.

Also, in any given imaging system 20 it is not necessarily the case thatthe sense of the input device is the same as the sense of the outputdevice. In the event that the senses of the input and output devices arenot coordinated in a given imaging system, the output images may beprojected in the manner opposite to the manner in which they should beprojected. Consequently, under such circumstances the output images maylook like a photographic negative, for example.

Accordingly, IAS 1020 determines from both the input device 22 and theoutput device 30 what their respective senses are. In response, IAS 1020will then determine whether it needs to reverse the sense of the inputdevice, thereby activating a "ReverseIn" operation. IAS 1020 will alsodetermine whether it needs to reverse the sense of the output device,thereby activating a "ReverseOut" operation.

It should be noted that the transform line modifiers discussed up tothis point - - - Steepness, Xoffset, Yoffset - - - are modifiers whichare manipulated through user interfaces, such as interfaces 1021 shownon FIG. 25. ReverseIn and ReverseOut, on the other hand, are responsiveto instruction signals provided by components within imaging system 20,such as input device 22 or output device 30. Additionally, these signalscould be provided in a file header of the data being processed byimaging system 20. ReverseIn and ReverseOut can only have one of twostates, those being either an asserted (on) or de-asserted (off) state.As discussed, whether the state is asserted or de-asserted is determinedon the basis of the sense of input device 22 or output device 30.

Referring now to FIG. 31, the effect ReverseIn has on transformingRIL<x,y> values to IL<x,y> values is graphically shown. Transform line960 first defines a given transform expression for mapping RIL<x,y> toIL<x,y>. FIG. 31 shows a dashed, vertical line 962 running through(NRIL-1)/2. By definition, when "ReverseIn" is asserted, transform line960 is effectively rotated 180 degrees about vertical line 962. In thismanner the sense of the data from input device 22 is reversed by theassertion of ReverseIn. In other words, through the switching ofReverseIn the binary values of the data forming the input image isreversed such that 0 becomes 1 and 1 becomes 0.

A similar function is shown in FIG. 32, in which the effects ofReverseOut on transforming RIL<x,y> values to IL<x,y> values isgraphically shown. In FIG. 32, transform line 960 defines the sametransform expression as shown in FIG. 31 for mapping RIL<x,y> toIL<x,y>. FIG. 32 shows a dashed, horizontal line 970 running through(NIL-1)/2. By definition, when "ReverseOut" is asserted, transform line960 is effectively rotated 180 degrees about horizontal line 970. Inthis manner the sense of the data of output device 30 is reversed by theassertion of ReverseOut. Similar to the effect of the ReverseInfunction, through the switching of ReverseOut the binary values of thedata forming the output image is reversed such that 0 becomes 1 and 1becomes 0.

In certain imaging systems 20, it may be necessary to alter therepresentation of signed raw input levels to provide adjusted inputlevels. For example, FIG. 33 provides two methods by which signedinformation may be represented. In many YUV color systems, for example,the chrominance component of the image, namely the U and V information,is presented in a twos complement format. On FIG. 33, next to the twoscomplement representation of a given number is the binary codedesignation, with the unsigned representation and the sign shiftedrepresentation of the number shown beside the corresponding binary code.In the event that the representation of the RIL<x,y> value needs to bechanged to provide IL<x,y>, IAS 1020 includes a sign conversionfunction, which is operated by "Sign Shift".

Similar to the ReverseIn and ReverseOut functions discussed above, SignShift is either asserted or de-asserted. Also like ReverseIn andReverseOut, Sign Shift is not determined by a user interface, but ratheris determined by an instruction signal provided by other componentswithin imaging system 20, or by a signal provided in the file header ofthe data that is being processed by the system.

FIG. 34 provides a graphical representation of the manner by which SignShift transforms RIL<x,y> values to IL<x,y> values. More particularly,line 974 of FIG. 34 shows the effects of applying the Sign Shiftfunction to the identity transform line 920 shown on FIG. 26 . Thus,with respect to the identity transform line 920, the Sign Shift functionserves to map the RIL<x,y> values from 0 to (NRIL-1)/2 to IL<x,y> valuesfrom (NIL-1)/2 to (NIL-1). Additionally, RIL<x,y> values from (NRIL-1)/2to (RNIL-1) are mapped to IL<x,y> values from 0 to (NIL-1).

Finally, with respect to the translation of raw input levels to adjustedinput levels, FIG. 35 shows the method by which a lesser number of rawinput levels are mapped to a greater number of adjusted input levels.Unlike the transform function which was illustrated in FIG. 26 in whichNRIL is equal to NIL, in FIG. 35, NRIL is less than NIL. The diagonalestablished by transform line 980 shows an identity-like translation ofthe raw input levels to adjusted input levels. Even though there arefewer raw input levels than adjusted input levels, FIG. 35 shows how theraw input levels would be mapped to a given adjusted input level.

For example, on FIG. 35 RIL_(a) maps to IL_(y), indicating that the rawinput level does not necessarily map to an identical adjusted inputlevel. This mapping is accomplished in IAS 1020 by means of furtheradjusting the transformation line by increasing or decreasing the rangeof adjusted input levels. As discussed above, although NRIL is a fixedsystem parameter, NIL is variable, and can be assigned by imaging system20 to IAS 1020. To the extent that the value of NIL is assignable byimaging system 1020, IAS 1020 can be used to transform a greater numberof raw input levels to a lesser number of adjusted input levels, or alesser number of raw input levels to a greater number of adjusted inputlevels.

Also, the discussion of the bit shifter implementation, shown in FIGS.19 and 20 above, was is based on the understanding that IP 740 couldassign the range of input levels it would receive for processing. Forthose systems that do not have that inherent capability, it wasindicated that an imaging system with a given, fixed number of inputlevels could have that number of input levels adjusted by means of imageadjustment system.

As discussed in connection with FIG. 35, IAS 1020 can be used totranslate a given number of raw input levels to either a greater orlesser number of adjusted input levels. Accordingly, IP 740 of FIG. 19could be coupled to IAS 1020 in the manner shown in FIG. 40D, so thatwhen IP 740 determines the NIL, IAS 1020 will insure that only inputlevels falling within the assigned range are sent to IP 740 forprocessing.

Having discussed the types of adjustments that can be made through thetransform functions so that raw input levels are translated intoadjusted input levels, an embodiment of IAS 1020 can now be addressed.Referring now to FIG. 36, IAS 1020 includes variables determiner circuit1120, data assignor circuit 1122, data store memory 1124, and signconverter circuit 1126. IAS 1020 is shown to include adjust LUT memory1130, in which values are ultimately stored.

In FIG. 36, variables determiner 1120 is fed by signals correspondingto: Steepness, Xoffset, Yoffset, ReverseIn, Reverseout, NRIL, and NIL.As indicated above, in one implementation the signals for Steepness,Xoffset, and Yoffset would be furnished by a user interface, such asinterface 1021 shown on FIG. 25. These may be similar to the brightnessor contrast dial on a standard video monitor. The other signals forvariables determiner 1120, ReverseIn, Reverseout, NRIL, and NIL would befurnished by imaging system 20, or provided in a file header of databeing processed. In particular, NIL is the variable discussed abovewhich is assigned by imaging system 20, and which determines whether thenumber of raw input levels will be transformed to a greater or lessernumber of adjusted input levels.

Variables determiner 1120 provides values corresponding to m and b,which are discussed below, and High, Low, and Top to data assignor 1122.Data assignor 1122 outputs intermediate values, which are collectivelyreferred to as "A₁ ", which are stored in a memory device, such as datastore 1124. The A₁ values in data store 1124 are then transferred tosign converter 1126. If the Sign Shift signal is asserted, signconverter 1126 will convert the representation of signed values storedin data store 1124. If the Sign Shift signal is not asserted, then theA₁ values stored in data store 1124 pass through sign converter 1126without modification.

Whether sign converter 1126 converts the A₁ values or not, signconverter 1126 outputs the final table of adjusted values, A<IL>, forstorage in adjust LUT 1130. Once the values A<IL> are stored in adjustLUT 1130, the raw input levels, RIL<x,y>, are used to address the LUT.Accordingly, a given RIL<x,y> will cause a corresponding, adjustedIL<x,y> to be produced by adjust LUT 1130.

As indicated above, in certain implementations involving color systems,a number of IAS's 1020 were used together so that each component of thecolor image had its own image adjustment system. In another embodiment,it is possible to have a single variables determiner 1120, a single dataassignor 1122, and a single sign converter 1126 for processing data thatis stored in an adjust LUT 1130 for the Y component, another adjust LUT1130 for the U component, and yet another adjust LUT 1130 for the Vcomponent, for an input device based on the luminance/chrominanceformat. The same can be done with respect to an input device based onthe RGB format. In other words, instead of duplicating the components ofIAS 1020 which process the values that are stored in the LUT's, it ispossible to have one set of components which compute and fill a separateadjust LUT's 1130 for each or the color components.

For example, a single variables determiner 1120, data assignor 1122, andsign converter 1126 can first process the adjusted input levels that arestored in an adjust LUT 1130 for the Y component, based on the desiredcontrast and brightness of the output image, as well as the senses ofthe input and output devices, the representation of signed raw inputlevels, and the desired range of input levels. Then those samecomponents can process the adjusted input levels stored in an adjust LUT1130 for the U component, based on the desired saturation and whitebalance control of the output image, as well as the senses, therepresentation, and the range. And finally, the same components canprocess adjusted input levels stored in an adjust LUT 1130 for the Vcomponent, again on the basis of the desired saturation and whitebalance control of the output image, and the senses, the representation,and the range.

In yet another example, a single set of variables determiner 1120, dataassignor 1122, and sign converter 1126 can be used to process and storeadjusted input levels in an adjust LUT 1130 for the R component, anadjust LUT 1130 for the G component, and an adjust LUT for the Bcomponent, in an imaging system in which the input device representsdata in the RGB format.

With this general background on the operation of IAS 1020, reference cannow be made to the flow diagrams which detail how the various signalsare used by the components of IAS 1020 to fill adjust LUT 1130.

Referring now to FIG. 37, the steps of the process are shown to includea decision step 1150 with variables determiner 1120 testing theSteepness of the transform line setting to determine if it is greaterthan zero. If yes, the process advances to step 1152 in which thevariable "m" is made equal to 1/(1-Steepness). It should be noted thatalthough "m" has not been previously described, it is a variable whichdefines the slope of the transform line, such as the transform linesdiscussed in connection with FIGS. 26 through 32, and m is determined byvariables determiner 1120. After the value of m is determined, dataassignor 1122 uses that variable in the manner described herein.

Referring back to decision step 1150, if Steepness is not greater thanzero, then the process advances to step 1154 and m is set as equal to(1+Steepness). From both steps 1152 and 1154 the process advances tostep 1156.

In step 1156 a new variable, b, is made equal to(NRIL-1)(1+Yoffset-m<1+Xoffset>)/2. Similar to the variable m, b is avariable which defines the y-intercept of the transform line and itsvalue is determined by variables determiner 1120. Also like m, b is usedby data assignor 1122 in the manner detailed below.

From step 1156, the process advances to decision step 1160 in whichvariables determiner 1120 tests the ReverseIn value to determine whetherit is asserted. If yes, the process advances to step 1162 and b is setequal to m(NRIL-1)+b, and m is set equal to (-m). If ReverseIn is notasserted, or after step 1162 resets the value of b and m, the processadvances to decision step 1164.

In decision step 1164, variables determiner 1120 tests the ReverseOutvalue to determine whether it is asserted. If yes, the process advancesto step 1166 in which b is set equal to NRIL -1-b, and m is set equal to(-m). If ReverseOut is not asserted, or after step 1166 resets the valueof m and b, the process advances to decision step 1170.

In decision step 1170, variables determiner 1120 tests whether m isequal to zero. If yes, the process advances to decision step 1172 atwhich point the variable "High" is set as equal to NRIL, and thevariable "Low" is set as equal to (-1). Both High and Low were shown anddescribed in conjunction with the discussion of FIG. 28. In the otherhand, if m is not equal to zero, then the process advances to step 1174and High is made equal to max {(NRIL-1-b)/m, (NRIL-1)}, and Low is madeequal to max {(-b/m), (NRIL-1)}, where "max {A,B}" is defined as beingequal to the greater of A or B.

After the setting of the High and Low values in either step 1172 or1174, the process advances to step 1176 in which b is set as equal to b(NIL-1)/(NRIL-1) , m is set equal to m (NIL-1)/(NRIL-1). It should benoted that this is the point of the process in which the number of inputlevels, NIL, assigned by imaging system 20, is factored into the shapingof the transform line. This number determines how raw input levels aretransformed to adjusted input levels. In particular, the actual value ofNIL will determine whether the raw input levels are transformed to agreater or lesser number of adjusted input levels.

Additionally, in Step 1176 "Top" is set as equal to NIL. Like thevariables High and Low, Top was also shown and discussed in connectionwith FIG. 28. After step 1176, the process advances to step 1180 inwhich the values for m, b, High, Low, and Top are transferred to dataassignor 1122, which is shown in FIG. 37.

It is notable that at this point of the process all of the variableswhich are needed for the purpose of translating RIL to IL have beenproduced by IAS 1020. In particular, for a monochrome imaging system,variables determiner 1120 has produced a set of variables which takeaccount of the senses of the input and output devices, the number ofinput levels to be processed by the image processor, and the desiredcontrast and brightness of the output image. On the other hand, for acolor system, variables determiner 1120 has produced a set of variableswhich take account of the senses of the input and output devices, thenumber of input levels to be processed by the image processor, and thedesired saturation, luminance, and white balance control of the outputimage. Having computed these variables, IAS 1020 is now in a position torapidly produce the variables which are inserted in adjust LUT 1130.This is accomplished in data assignor 1122.

Referring now to FIG. 39, at the beginning of the process, step 1190shows that signals corresponding to the values for m, b, High, Low andTop have been transmitted to data assignor 1122. The process thenadvances to assigning the value zero to the variable "x" in step 1192.After this, the process advances to decision step 1194 in which dataassignor 1122 tests the value of m to determine if it is less than zero.As seen by looking at the flow diagram provided in FIG. 38, if m is notless than zero, then the process advances through the left branch of theflow diagram. If m is less then zero then the process advances throughthe right branch of the flow diagram. These two branches are separate,and do not reunite until the bottom of the flow diagram, therefore eachcomplete branch will be discussed independently of the other.

If decision step 1194 is answered in the negative because m is not lessthen zero, the process advances to decision step 1196, at which pointdata assignor 1122 tests x to determine whether x is greater than Low.If not, then A<x>, which at this stage of the process is A<0>, is setequal to zero. In other words, referring back to FIG. 36, the addresslocation 0 of data store 1124 is loaded with the value 0 by dataassignor 1122. Additionally, x is incremented by one in step 1220.

From step 1220 the process returns to the test of decision step 1196. Tothe extent that x is incremented in step 1120 it may no longer be lessthan Low. If it is still less then Low, then the process will continueto cycle through steps 1196 and 1220. As long as the cycling continues,the various values of x will determine the address locations of datastore 1124 at which a 0 value is stored. For example, if when x=1, it isstill not greater than Low, then A<1> will be set equal to 0, or addresslocation 1 of data store 1124 will have the value 0 stored therein.Also, if when x=2, it is not greater than Low, then A<2> will also beset equal to 0, and address location 2 will have the value 0.

Due to the incrementation of x, it will eventually be greater than Low.At that point, decision step 1196 will be answered in the affirmative,and the process advances to step 1222. In step 1222 the variable "y" isset equal to (mx+b+1/2) .

After step 1222, the process advances to decision step 1224 in whichdata assignor 1122 tests the value of x to determine if it is greaterthan High. If x is not greater than High, then the process advances tostep 1226 in which A<x> is set equal to int{y}. As discussed above, atthis stage of the process, the actual value of int{y} is stored in the xaddress of data store 1124.

After the computation of the value of int{y} and the storage of thatvalue in data store 1124, step 1226 further includes setting y equal toy+m, and x is set equal to x+1. After these settings the process cyclesback to decision step 1224 to determine if x is greater than High. Untilx is greater than High, the process continues to cycle back through step1226 and the values of int{y} are stored in there corresponding addresslocations in data store 1124. Again, due to the incrementation in step1226, the answer to decision step 1224 will eventually be in theaffirmative, at which point the process will advance from decision step1224 to decision step 1230.

In decision step 1230 data assignor tests x to determine if it is lessthan NRIL. If yes, the process advances to step 1232 in which A<x> isset equal to Top. As in the previous steps, 1220 and 1226, this value isstored in the x address of data store 1124. After the storage of thatvalue, x is set equal to x +1.

From step 1232 the process returns to decision step 1230. The processcontinues to cycle through steps 1230 and 1232 until x is not less thenNRIL, which must eventually occur as a result of the incrementation of xin step 1232. During this cycling, the address locations of data store1124, A<x> are filled with the value Top.

When decision step 1230 is answered in the negative the process advancesto step 1234 in which shows that all A₁ values have been loaded in datastore 1124.

Returning to decision step 1194 on FIG. 38, if data assignor 1122 testsm to determine if it is less then zero and the answer is yes, then theprocess advances to decision step 1240 at which point data assignor 1122tests x to determine whether x is greater than High. If not, then A<x>is set equal to Top, and x is incremented by one in step 1242. Aspreviously discussed, the Top value is stored in the x address locationof data store 1124.

From step 1242 the process returns to the test of decision step 1240. Ifx is still not greater than High, the process will continue to cyclethrough steps 1240 and 1242. During the cycling the correspondingaddress locations of data store 1124 are filled. Due to theincrementation of x, it will eventually test greater than High anddecision step 1240 will be answered in the affirmative, advancing theprocess to step 1244. In step 1244 the variable "y" is set equal to(mx+b+1/2).

After step 1244, the process advances to decision step 1246 in whichdata assignor 1122 tests the value of x to determine if it is less thanLow. If x is not less than Low, then the process advances to step 1250in which A<x> is set equal to int{y}, and that value is stored in datastore 1124. Then, y is set equal to y+m, and x is set equal to x+1.After these settings the process returns to decision step 1246 todetermine if x is less than Low. Due to the incrementation in step 1250,the answer to decision step 1246 will eventually be in the affirmative,at which point the process will advance from decision step 1246 todecision step 1252. During the cycling, the address locations of datastore 1124 are filled with values corresponding to int{y}.

In decision step 1252 data assignor tests x to determine if it is lessNRIL. If yes, the process advances to step 1254 in which A<x> is setequal to zero, and that value is stored in data store 1124 Also, in step1254 x is set equal to x+1. From step 1254 the process returns todecision step 1252. The process continues to cycle through steps 1252and 1254 until x is not less then NRIL, which must eventually occur as aresult of the incrementation of x in step 1254. During that cycling, theaddress locations in data store 1124 corresponding to A<x> are filledwith the value 0.

When decision step 1252 is eventually answered in the negative theprocess advances to step 1234, discussed above, showing that all A₁values have been loaded in data store.

Referring momentarily back to FIG. 36, sign converter 1126 is responsiveto the signal for Sign Shift and NIL. In the event that Sign Shift isasserted, sign converter 1126 will shift the sign representation of allof the A₁ values transmitted to it by data store 1124.

Now referring to FIG. 39, a flow diagram is provided which describes theprocess by which sign converter 1126 operates. At the beginning of theprocess, step 1260 shows that the A₁ values are stored in data store1224, shown on FIG. 36. From this step, the process advances to decisionstep 1262, which tests whether the Sign Shift signal is asserted. If no,then the signs of the values do not have to be converted, and the A₁values effectively pass through sign converter 1126 unchanged. Thus, theprocess advances to step 1264, and the values A<IL>, which are the fullyadjusted values, are stored in adjust LUT 1130.

On the other hand, if the Sign Shift signal is asserted, and decisionstep 1262 is answered in the affirmative, the process advances to step1266. In step 1266 the variable "i" is set equal to zero, and thevariable "j" is set equal to NRIL/2.

From step 1266 the process advances to decision step 1270 in which signconverter 1126 tests i to determine if it is greater than NRIL/2. If no,the process progresses to step 1272 in which the variable "Hold" is setequal to A(i), then A(i) is set equal to A(j), then A(j) is set equal toHold, then i and j are each incremented by one. Through this step, signconverter 1126 is effectively swapping the values of A₁ between memorylocations. For example, during the first swap, the value at A<O> isswapped with the value at A<NRIL/2>. This is accomplished by firstmaking Hold equal to the value at address location 0, then the value ataddress location 0 is made equal to the value at address locationNRIL/2, and finally the value at address location NRIL/2 is made equalto Hold, which was the original value at address location 0.

After this, step 1272 returns to decision step 1270 in which i is testedto determine if it is greater than NRIL/2. If it is not, then step 1272is repeated, resulting in the swapping two more values of A₁.

Given that i is incremented by one each time the process cycles throughstep 1272, i will eventually test greater than NRIL/2. At that point,all of the sign converted A₁ have been stored in adjust LUT 1264.

After the adjusted input levels are stored in adjust LUT 1264, they areinput levels which can be processed by an image processor. Moreparticularly, as shown on FIG. 36, adjust LUT 1130 is adapted for havingthe raw input level, RIL<x,y>, provided by the input device 22 shown onFIG. 25, operate as the address to adjust 1130. Accordingly, RIL<x,y>will be transmitted to adjust LUT 1130, and in response adjust LUT 1130will output a corresponding input level, IL<x,y>. Thereafter, IL<x,y> isprocessed by the image processors in the manner discussed above.

FIGS. 40A, 40B, 40C, and 40D provide illustrations of alternateembodiments in which an image adjustment system has been implemented inthe image processors discussed above. In connection with each, there isshown an IAS, respectively numbered 1020a, 1020b, 1020c, and 1020d.Excepting only IAS 1020c , each IAS is shown to receive a signal whichcorresponds to a raw input level, RIL<x,y>, and responds to that signalby outputting a corresponding adjusted input level, IL<x,y>. Withrespect to IAS 1020c address/level generator 490 produces a raw inputlevel, RIL, which operates as an address to an adjust LUT 1130 in IAS1020c so that IAS 1020c outputs an input level, IL. As detailed above ILis then used by SMTVD 481 to provide signals to SMRTS 497. Other thanthis minor variation, IAS 1020c operates the same as the general IAS1020 discussed above.

As seen in FIGS. 40A-40D, with IAS 1020 implemented in the fourembodiments of the image processors discussed above, the adjusted inputlevel, IL<x,y>, output by IAS 1020 would then be processed by the fourdifferent run time systems, in the manner described in connection withthe detailed description of each of those systems.

G. Color Implementation

As discussed in the beginning of the detailed description, theembodiments of the above described image processors and image adjustmentsystem were presented in the context of "levels", as opposed to"colors". This was to illustrate how these systems and image processingtechniques are generally applicable bi-tonal, monochrome and colorsystems. On the other hand, another embodiment of the present inventioncan be readily adapted to an imaging system which specifically includescolor systems of the luminance/chrominance, or RGB variety.

Referring now to FIG. 41, an embodiment of an imaging system 1320 whichprocesses color images is provided. Imaging system 1320 includes inputdevice 22 which registers an input image which is to be mapped to outputdevice 30. Once again the objective of the embodiments of the presentinvention is to take the input levels and map them to the output levels.Typically, NOL will be greater than NIL; however, as stated above, it isalso possible to use this system when NIL=NOL.

In the particular embodiment shown in FIG. 41, input device 22 registersthree primary input levels: IL_(a) <x,y>, IL_(b) <x,y>, and IL_(c)<x,y>. For the purpose of illustration, the three input levels may bethree color primaries, such as red, green, and blue (RGB), for example.In such an example, IL_(a) <x,y> could represent the level of the redcolor at the pixel address x,y; IL_(b) <X,y> could represent the levelof the green color at the pixel address x,y; and IL_(c) <x,y> couldrepresent the level of the blue color at the pixel address x,y.

In imaging system 1320 each of the three primary colors has multiplelevels ranging from 0 to (NIL-1). In other words, just like the range ofinput levels discussed in connection with FIGS. 4 and 5, involving onlyone color, in this instance each of the three color primaries has itsown range of input levels. For example, there may be multiple levels, orshades, of the colors red, green or blue. Moreover, the implementationof the imaging system 1320 does not require the three color primaries tohave the same number of input levels as each other.

As shown in FIG. 41, the three input levels are each coupled with theirown IP, respectively IP 1340a , IP 1340b , and IP 1340c . In imagingsystem 1320, each IP can be any one of the implementations of the IPdevices discussed above. Namely, each IP 1340a , 1340b , or 1340c couldbe implemented using IP 40, 140, 440, 740, or the alternate embodimentsof those image processors, such as IP 40a , 140b , 440c 740d, whichinclude and image adjustment system. Additionally, as discussed inconnection with IAS 1020, each image processor may be used together withan IAS 1020. Thus, for color images that are made up of multiplecomponents, such as YUV or RGB, the image processors, such as IP 1340a ,1340b , and 1340c , could each include an IAS 1020 for each of thecomponents of the color image, as discussed above. Finally, given thateach IP operates independently of the others, they do not necessarilyneed to be the same type of implementation.

Although the specifics of the operation of the system will depend uponthe particular implementation chosen, in general IP 1340a , 1340b ,1340c will each process and store dither template values and quantizedvalues. And, consistent with the discussion provided above in connectionwith the implementation of each IP, the incoming address of a giveninput pixel and its corresponding input level will be used as an addressby the image processor to output a corresponding output level.

For example, in FIG. 41 input device 22 transmits an input level IL_(a)<x,y> to IP 1340a , or input device 22 could transmit RIL<x,y> if animage adjustment system is used. In one implementation, this could bethe level of the red color component of the input pixel at the givenaddress, x,y. That input level is treated by IP 1340a in the same manneras has been described in connection with the image processors discussedabove. Ultimately, IP 1340a outputs a corresponding output level, OL_(a)<x,y>, which is then sent to output device 30.

In this particular example, input device 22 would also output the inputlevels of the green and blue color components of the same input pixel atthe same address, respectively IL_(b) <x,y>, IL_(c) <x,y>. Those inputpixels are likewise processed by their respective image processors, IP1340b and 1340c . And, each IP outputs a corresponding output levelOL_(b) <x,y>, OL_(c) <x,y>, to output device 30.

When the three output levels - - - RGB - - - are combined in the sameoutput pixel in output device 30, the color of the output image will bereproduced with pleasing results, even if output device 30 has anarrower range of output levels for representing the three colorprimaries than input device 20.

One consequence of the approach described is that the dithered colorimage effectively has 3 dither matrices overlaid on top of one another.If the source image is in a highly correlated color space, such as RGB,and the number of output colors is small, then dithering with the samein-phase dither matrix can produce harsh patterns in neutral density (nochrominance) image areas.

These harsh patterns can be mitigated by offsetting the dither matricesslightly relative to one another. This is precisely the reason for thephase adjustment process through which the dither matrix values areadjusted by a phase adjuster, such as phase adjuster 98, shown in FIG.7, or phase adjuster 798, shown in FIG. 20. It may be recalled, inconnection with the discussion of FIGS. 7 and 20 in particular, theimage processors received as one of the inputs a phase₋₋ x and a phase₋₋y value. In one implementation, the user of the imaging system 20 mayselect the actual phase₋₋ x and phase₋₋ y values, provided:

    0≦phase.sub.-- x<M.sub.mm ; and

    0≦phase.sub.-- y<N.sub.mm.

Also, each pair of phase₋₋ x, phase₋₋ y values for a given colorcomponent should be different from the pairs for the other colorcomponents.

For example, with respect to RGB images, the following phase₋₋ x,phase₋₋ y settings work well for 8×8 dither matrices:

    ______________________________________                                                     Phase.sub.-- x                                                                       Phase.sub.-- y                                            ______________________________________                                        Red            0        0                                                     Green          3        3                                                     Blue           0         3.                                                   ______________________________________                                    

Finally, although FIG. 41 shows three image processors linked toimplement the color system, in other implementations any differentnumber of image processors could be similarly assembled to link inputdevice 22 with output device 30 depending on the number of colors to berepresented in the imaging system 1320.

H. Summary

It will be clear to those skilled in the art that the embodiments of theimage processing systems and techniques of the present invention can beimplemented in either hardware or software. In other words, theembodiments discussed can be implemented using software code with ageneral purpose computing device to accomplish the processing of data todetermine quantization and dither template values, as well as todetermine the actual computation of the output levels. Additionally,more specialized computer hardware could be used to compute specificequations which yield the data necessary for the implementation of theembodiments discussed. AS is well know in the computer art, there isconstant tension between performing operations with specializedhardware, which increases the speed of the system, but requires valuablechip space, and performing operations in software, which takes upvirtually no valuable chip space, but may take longer.

One of the significant advantages of the imaging systems discussed isthat in certain implementations the hardware requirements are sominimal. Such implementations rely upon having memory devices, adders,comparators, and bit shifters. This type of hardware is commonlyavailable in general computing devices.

The present invention in its broader aspects is therefore not limited tothe specific details, representative apparatus. and illustrativeexamples shown and described herein. Departures hay be made from suchdetails without departing from the spirit or scope of the invention.

What is claimed is:
 1. An apparatus for translating input levels of animaging system to corresponding output levels, said apparatuscomprising:memory means for storing dither template values, said memorymeans being responsive to an address of an input cell of an input deviceto provide a dither template value which corresponds to the address ofthe input cell; means for adding an input level of the input cell to thedither template value provided by said memory means to provide a sum(S), said adding means producing a finite number of unique S valueswhich map to a single, given output level; shifter means for bitshifting the S value provided by said adding means; and both the numberof input levels and the number of output levels produced by the imagingsystem being any number, provided the number of input levels in equal toor greater than the number of output levels, and further provided thatan average number of unique S values, determined by averaging the numberof unique S values which map to each of the given output levels, isequal to an integer power of two.
 2. The apparatus as in claim 1,wherein the dither template values are normalized by symmetricallydistributing the dither template values between 0 and the average numberof unique S values.
 3. The apparatus as in claim 2, wherein thenormalized dither template values (D<x',y'>) are related to a number ofinput levels (NIL); a number of output levels (NOL); a Δ_(Q) ; a Δ_(d) ;a dither template (T<x',y'>); and a number of template levels of theimaging system (NTL) by:

    Δ.sub.Q =(NIL-1)/(NOL-1);

    Δ.sub.d =Δ.sub.Q /(NTL); and

    D<x',y'>=int {Δ.sub.d (T<x',y'>)+0.5}.


4. The apparatus as in claim 3, wherein the dither template values arephase adjusted by spatially shifting the values within the dithertemplate.
 5. The apparatus as in claim 4, wherein the phase adjusteddither template values (d<x',y'>) are related to a number of inputlevels (NIL); a number of output levels (NOL); a Δ_(Q) ; a Δ_(d) ; adither template (T<x',y'>); a number of template levels of the imagingsystem (NTL); a phase value of the x,y address of an input cell (phase₋₋x, phase₋₋ y); and the dimensions of said memory means (M_(mm), N_(mm))by:

    Δ.sub.Q =(NIL-1)/(NOL-1);

    Δ.sub.d =Δ.sub.Q /(NTL);

    D<x',y'>=int {Δ.sub.d (T<x',y'>)+0.5}; and

    d<x',y'>=D<(x'+phase.sub.-- x)modulo(M.sub.mm), (y'+phase.sub.- y)modulo(N.sub.mm)>.


6. The apparatus as in claim 1, wherein said shifter means shifts the Svalue R bits to the right, where

    R=int{log.sub.2 (2.sup.B -1)/(NOL-1)};

B=the number of bits of the input level; and NOL=the number of outputlevels.
 7. An apparatus for translating input levels of an imagingsystem to corresponding output levels, said apparatus comprising:Look UpTable (LUT) generator means for generating dither template values forthe input levels of an imaging system; memory means for storing thedither template values generated by the LUT generator means, said memorymeans being responsive to an address of an input cell of an input deviceto provide a dither template value which corresponds to the address ofthe input cell; means for adding an input level of the input cell to thedither template value provided by said memory means to provide a sum(S), said adding means producing a finite number of unique S valueswhich map to a single, given output level; shifter means for bitshifting the S value provided by said adding means; and both the numberof input levels and the number of output levels produced by the imagingsystem being any number, provided the number of input levels is equal toor greater than the number of output levels, and further provided thatan average number of unique S values, determined by averaging the numberof unique S values which map to each of the given output levels, isequal to an integer power of two.
 8. The apparatus as in claim 7,wherein the dither template values are normalized by symmetricallydistributing the dither template values between 0 and the average numberof unique S values.
 9. The apparatus as in claim 8, wherein the dithertemplate values are phase adjusted by spatially shifting the valueswithin the dither template.
 10. An apparatus as in claim 9, furthercomprising an image adjustment system, said image adjustment systembeing responsive to a raw input level produced by an input device toprovide an input level to said adding means.
 11. The apparatus as inclaim 7, wherein said shifter means shifts the S value R bits to theright, where

    R=int {log.sub.2 (2.sup.B -1)/(NOL-1)};

B=the number of bits of the input level; and NOL=the number of outputlevels.
 12. An imaging system comprising:an input device for producinginput levels; an output device for producing output levels; an imageprocessor, coupled between said input and output devices, fortranslating the input levels to corresponding output levels, said imageprocessor including: Look Up Table (LUT) generator means for generatingdither template value for the input levels of an imaging system; memorymeans for storing the dither template values generated by the LUTgenerator means, said memory means being responsive to an address of aninput cell of an input device to provide a dither template value whichcorresponds to the address of the input cell; means for adding an inputlevel of the input cell to the dither template value provided by saidmemory means to provide a sum (S), said adding means producing a finitenumber of unique S values which map to a single, given output levels;shifter means for bit shifting the S value provided by the adding means;and both the number of input levels and the number of output levelsproduced by the imaging system being any number, provided the number ofinput levels is equal to or greater than the number of output levels,and further provided that an average number of unique S values,determined by averaging the number of unique S values which map to eachof the given output levels, is equal to an integer power of two.
 13. Theimaging system as in claim 12, wherein the dither template values arenormalized by symmetrically distributing the dither template valuesbetween 0 and the average number of unique S values.
 14. The imagingsystem as in claim 13, wherein the dither template values are phaseadjusted by spatially shifting the values within the dither template.15. The imaging system as in claim 12, further comprising a second imageprocessor, and wherein the input levels of the input device arecomponents of a color system.
 16. A method of translating input levelsof an imaging system to output levels, said method comprising the stepsof:generating dither template values for the output levels of an imagingsystem; storing the dither template values in a memory means, saidmemory means being responsive to an address of an input cell of an inputdevice to provide a dither template value which corresponds to theaddress of the input cell; adding the dither template value output by amemory means in response to an address of the input cell to an inputlevel of the input cell to produce a sum (S), said adding step beingaccomplished with an adding means which produces a finite number ofunique S values which map to a single given output level; and bitshifting the S value to produce an output level for an output device,both the number of input levels and the number of output levels producedby the imaging system being any number, provided the number of inputlevels is equal to or greater than the number of output levels, andfurther provided that an average number of unique S values, determinedby averaging the number of unique values which map to each of the givenoutput levels, is equal to an integer power of two.
 17. The method as inclaim 16, wherein said generating step includes:normalizing the dithertemplate values by distributing the dither template values between 0 andthe average number of unique S values.
 18. The method as in claim 17,wherein said generating step includes:phase adjusting the dithertemplate values by spatially shifting the values within the dithertemplate.
 19. The method as in claim 16, wherein said shifting stepincludes shifting the S value R bits to the right, where

    R=int{log.sub.2 (2.sup.B -1)/(NOL-1)};

B=the number of bits of the input level; and NOL=the number of outputlevels.